login
A027355
Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, all >= k.
0
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
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
Sequence in context: A287146 A025926 A175134 * A127326 A321923 A064663
KEYWORD
nonn,tabl
EXTENSIONS
Title corrected by Sean A. Irvine, Oct 27 2019
STATUS
approved