Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A056560
Tetrahedron with T(t,n,k)=n-k; succession of growing finite triangles with increasing values towards bottom left.
9
0, 0, 1, 0, 0, 1, 0, 2, 1, 0, 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 4, 3, 2, 1, 0, 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 6, 5, 4, 3, 2, 1, 0, 0, 1, 0, 2, 1, 0, 3, 2, 1, 0, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0
OFFSET
0,8
FORMULA
a(n) = A056557(n) - A056558(n).
EXAMPLE
First triangle: [0]; second triangle: [0; 1 0]; third triangle: [0; 1 0; 2 1 0]; ...
CROSSREFS
Together with A056558 and A056559 might enable reading "by antidiagonals" of cube arrays as 3-dimensional analog of A002262 and A025581 with square arrays.
Sequence in context: A364032 A333397 A101676 * A345415 A096608 A155102
KEYWORD
nonn
AUTHOR
Henry Bottomley, Jun 26 2000
STATUS
approved