login
A027345
Triangular array T given by rows: T(n,k) = number of partitions of n into distinct odd parts, the least being k.
2
1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
OFFSET
1,79
EXAMPLE
1; 0,0; 0,0,1; 1,0,0,0; ...
CROSSREFS
Sequence in context: A303709 A185778 A071164 * A328959 A086080 A369054
KEYWORD
nonn,tabl
STATUS
approved