

A334462


Irregular triangle read by rows: T(n,k) is the number of parts in the partition of n into k consecutive parts that differ by 4, n >= 1, k >= 1, and the first element of column k is in the row that is the kth hexagonal number (A000384).


6



1, 1, 1, 1, 1, 1, 2, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0, 3, 1, 2, 0, 1, 0, 0, 1, 2, 3, 1, 0, 0, 1, 2, 0, 1, 0, 3, 1, 2, 0, 1, 0, 0, 1, 2, 3, 1, 0, 0, 1, 2, 0, 1, 0, 3, 1, 2, 0, 4, 1, 0, 0, 0, 1, 2, 3, 0, 1, 0, 0, 0, 1, 2, 0, 4, 1, 0, 3, 0, 1, 2, 0, 0, 1, 0, 0, 0, 1, 2, 3, 4, 1, 0, 0, 0, 1, 2, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,7


COMMENTS

Since the trivial partition n is counted, so T(n,1) = 1.
This is also an irregular triangle read by rows: T(n,k), n >= 1, k >= 1, in which column k lists k's interleaved with k1 zeros, and the first element of column k is in the row that is the kth hexagonal number.
This triangle can be represented with a diagram of overlapping curves, in which every column of triangle is represented by a periodic curve.
For a general theorem about the triangles of this family see A285914.


LINKS



FORMULA



EXAMPLE

Triangle begins (rows 1..28):
1;
1;
1;
1;
1;
1, 2;
1, 0;
1, 2;
1, 0;
1, 2;
1, 0;
1, 2;
1, 0;
1, 2;
1, 0, 3;
1, 2, 0;
1, 0, 0;
1, 2, 3;
1, 0, 0;
1, 2, 0;
1, 0, 3;
1, 2, 0;
1, 0, 0;
1, 2, 3;
1, 0, 0;
1, 2, 0;
1, 0, 3;
1, 2, 0, 4;
...
For n = 28 there are three partitions of 28 into consecutive parts that differ by 4, including 28 as a valid partition. They are [28], [16, 12] and [13, 9, 5, 1]. The number of parts of these partitions are 1, 2, 4 respectively, so the 28th row of the triangle is [1, 2, 0, 4].


CROSSREFS



KEYWORD

nonn,tabf


AUTHOR



STATUS

approved



