|
| |
|
|
A026920
|
|
Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the greatest being k.
|
|
1
| |
|
|
1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 1, 3, 1, 1, 0, 1, 0, 2, 2, 3, 1, 1, 0, 1, 1, 2, 4, 3, 3, 1, 1, 0, 1, 0, 3, 3, 5, 3, 3, 1, 1, 0, 1, 1, 2, 6, 5, 6, 3, 3, 1, 1, 0, 1, 0, 3, 5, 8, 6, 6, 3, 3, 1, 1, 0, 1, 1, 3, 8, 8, 10, 7, 6, 3, 3, 1, 1, 0
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,17
|
|
|
CROSSREFS
| O(n, k) = E(n-k, 1)+E(n-k, 2)+...+E(n-k, m), where m=MIN{k, n-k}, n >= 2, E given by A026921.
Sequence in context: A104234 A037870 A206588 * A060763 A131576 A100073
Adjacent sequences: A026917 A026918 A026919 * A026921 A026922 A026923
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
