Triangle T(n, k) is the number of times 2^k*3^(-n) arises in the n-th 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.

A348863

Triangle T(n, k) is the number of times 2^k*3^(-n) arises in the n-th 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.