|
Search: id:A026815
|
|
|
| A026815 |
|
Number of partitions of n in which the greatest part is 9. |
|
+0
10
|
|
| 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 41, 54, 73, 94, 123, 157, 201, 252, 318, 393, 488, 598, 732, 887, 1076, 1291, 1549, 1845, 2194, 2592, 3060, 3589, 4206, 4904, 5708, 6615, 7657, 8824, 10156, 11648, 13338, 15224
(list; graph; listen)
|
|
|
OFFSET
|
1,11
|
|
|
MAPLE
|
part_ZL:=[S, {S=Set(U, card=r), U=Sequence(Z, card>=1)}, unlabeled]: seq(count(subs(r=9, part_ZL), size=m), m=1..50); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 09 2007
|
|
MATHEMATICA
|
Table[ Length[ Select[ Partitions[n], First[ # ] == 9 & ]], {n, 1, 60} ]
|
|
CROSSREFS
|
Essentially same as A008638.
Cf. A026810, A026811, A026812, A026813, A026814, A026816.
Sequence in context: A035997 A036008 A104502 this_sequence A008638 A008632 A035988
Adjacent sequences: A026812 A026813 A026814 this_sequence A026816 A026817 A026818
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
