|
Search: id:A027356
|
|
|
| A027356 |
|
Array read by rows: T(n,k) = number of partitions of n into distinct odd parts in which k is the greatest part, for k=1,2,...,n, n>=1. |
|
+0
2
|
|
| 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
First T(n,k) not 0 or 1 is T(17,9)=2, which counts 1+7+9 and 3+5+9. Row sums: A000700.
|
|
FORMULA
|
T(n, 1)=0 for all n; T(n, n)=1 for all odd n>1; and for n>=3, T(n, k)=0 if k is even, else T(n, k)=Sum{T(n-k, i): i=1, 2, ..., n-1} for k=2, 3, ..., n-1.
|
|
EXAMPLE
|
First 5 rows:
1
0 0
0 0 1
0 0 1 0
0 0 0 0 1
Row 40 with even-numbered terms deleted:
0 0 0 0 0 0 2 5 6 7 6 5 4 3 2 1 1 1 1;
E.g. final 2 counts these two partitions: 9+31 and 1+3+5+31.
|
|
CROSSREFS
|
Cf. A000700.
Sequence in context: A014184 A014359 A079998 this_sequence A011746 A123192 A071005
Adjacent sequences: A027353 A027354 A027355 this_sequence A027357 A027358 A027359
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), revised Jul 23 2004
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Sep 14 2008 at the suggestion of R. J. Mathar
|
|
|
Search completed in 0.002 seconds
|
