A027345 Triangular array T given by rows: T(n,k) = number of partitions of n into distinct odd parts, the least being k.

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

Links

Table of n, a(n) for n=1..91.

Example

1; 0,0; 0,0,1; 1,0,0,0; ...

Crossrefs

Sequence in context: A303709 A185778 A071164 * A328959 A086080 A369054

Adjacent sequences: A027342 A027343 A027344 * A027346 A027347 A027348

Keyword

nonn,tabl

Author

Clark Kimberling

Status

approved