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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026811 Number of partitions of n in which the greatest part is 5. 8
0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 10, 13, 18, 23, 30, 37, 47, 57, 70, 84, 101, 119, 141, 164, 192, 221, 255, 291, 333, 377, 427, 480, 540, 603, 674, 748, 831, 918, 1014, 1115, 1226, 1342, 1469, 1602, 1747, 1898, 2062, 2233, 2418, 2611, 2818, 3034, 3266, 3507, 3765 (list; graph; refs; listen; history; internal format)
OFFSET

1,7

MATHEMATICA

Table[Length[Select[IntegerPartitions[n], First[#]==5&]], {n, 1, 10}]

CROSSREFS

Essentially same as A001401.

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

Sequence in context: A103232 A062684 A033485 * A001401 A008628 A038499

Adjacent sequences:  A026808 A026809 A026810 * A026812 A026813 A026814

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

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

Corrected Mathematica program [Harvey P. Dale, Oct 24 2011]

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 14 08:06 EST 2012. Contains 205604 sequences.