

A112995


Triangular array T(n,k)=number of partitions of n in which the least part is <=k, for 1<=k<=n, n>=1.


0



1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 9, 10, 10, 10, 11, 11, 13, 14, 14, 14, 14, 15, 15, 19, 20, 21, 21, 21, 21, 22, 22, 26, 28, 29, 29, 29, 29, 29, 30, 30, 37, 39, 40, 41, 41, 41, 41, 41, 42, 42, 50, 53, 54, 55, 55, 55, 55, 55, 55, 56, 56, 68, 72, 74, 75, 76, 76, 76, 76
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)




