login
A027359
Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, all <= k.
2
1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 2, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 3, 3, 4
OFFSET
1,35
LINKS
FORMULA
T(n, k) = Sum_{j=1..k} A027356(n, j). - Sean A. Irvine, Oct 29 2019
CROSSREFS
Cf. A027356.
Sequence in context: A376562 A281083 A230629 * A236109 A279279 A035447
KEYWORD
nonn,look,tabl
STATUS
approved