A027355 Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, all >= k.

1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 0, 0, 0, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset

1,29

Links

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

Formula

T(n, k) = A000700(n) - Sum_{j=0..k-1} A027345(n, j). - Sean A. Irvine, Oct 27 2019

Example

Triangle begins:
  1;
  0, 0;
  1, 1, 1;
  1, 0, 0, 0;
  1, 1, 1, 1, 1;
  1, 0, 0, 0, 0, 0;
  ...

Crossrefs

Cf. A000700, A027345.

Sequence in context: A287146 A025926 A175134 * A127326 A321923 A064663

Adjacent sequences: A027352 A027353 A027354 * A027356 A027357 A027358

Keyword

nonn,tabl

Author

Clark Kimberling

Extensions

Title corrected by Sean A. Irvine, Oct 27 2019

Status

approved