OFFSET
1,9
COMMENTS
Since the trivial partition n is counted, so T(n,1) = 1.
This is an irregular triangle read by rows: T(n,k), n >= 1, k >= 1, in which column k lists k's interleaved with k-1 zeros, and the first element of column k is in the row that is the k-th octagonal 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.
FORMULA
T(n,k) = k*A334946(n,k).
EXAMPLE
Triangle begins (rows 1..24).
1;
1;
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;
1, 2;
1, 0;
1, 2;
1, 0, 3;
1, 2, 0;
1, 0, 0;
1, 2, 3;
...
For n = 24 there are three partitions of 24 into consecutive parts that differ by 6, including 24 as a valid partition. They are [24], [15, 9] and [14, 8, 2]. There are 1, 2 and 3 parts respectively, so the 24th row of this triangle is [1, 2, 3].
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Omar E. Pol, May 27 2020
STATUS
approved