

A348863


Triangle T(n, k) is the number of times 2^k*3^(n) arises in the nth partition appearing in an iterated sequence of partitions of 1 (one for each integer n) into numbers of the form 2^k*3^(n), for n>=0, read by rows.


0



1, 1, 1, 3, 1, 1, 7, 6, 0, 1, 21, 16, 3, 0, 1, 57, 51, 13, 0, 0, 1, 171, 149, 39, 5, 0, 0, 1, 499, 454, 117, 23, 0, 0, 0, 1, 1497, 1348, 360, 66, 9, 0, 0, 0, 1, 4449, 4083, 1061, 207, 41, 0, 0, 0, 0, 1, 13347, 12191, 3252, 591, 126, 17, 0, 0, 0, 0, 1, 39927, 36658, 9738, 1799, 370, 81, 0, 0, 0, 0, 0, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


COMMENTS

See Calegari link for details.


LINKS



EXAMPLE

Triangle begins:
1;
1, 1;
3, 1, 1;
7, 6, 0, 1;
21, 16, 3, 0, 1;
57, 51, 13, 0, 0, 1;
171, 149, 39, 5, 0, 0, 1;
...


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



