login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026810 Number of partitions of n in which the greatest part is 4. 11
0, 0, 0, 0, 1, 1, 2, 3, 5, 6, 9, 11, 15, 18, 23, 27, 34, 39, 47, 54, 64, 72, 84, 94, 108, 120, 136, 150, 169, 185, 206, 225, 249, 270, 297, 321, 351, 378, 411, 441, 478, 511, 551, 588, 632, 672, 720, 764, 816, 864, 920, 972, 1033, 1089, 1154, 1215, 1285, 1350 (list; graph; refs; listen; history; internal format)
OFFSET

1,7

COMMENTS

Also number of partitions of n into exactly 4 parts.

REFERENCES

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 275.

FORMULA

G.f.: x^4/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).

MATHEMATICA

Table[ Length[ Select[ Partitions[n], First[ # ] == 4 & ]], {n, 1, 60} ]

CROSSREFS

Essentially same as A001400.

Cf. A026811, A026812, A026813, A026814, A026815, A026816.

Sequence in context: A123399 A104738 A028309 * A001400 A008773 A008772

Adjacent sequences:  A026807 A026808 A026809 * A026811 A026812 A026813

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 11 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:59 EST 2012. Contains 205788 sequences.