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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030699 Maximal value of Q(n,m) (number of partitions of n into m distinct summands) for given n. 3
1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 7, 8, 10, 12, 14, 16, 19, 21, 24, 27, 34, 39, 47, 54, 64, 72, 84, 94, 108, 120, 136, 150, 169, 192, 221, 255, 291, 333, 377, 427, 480, 540, 603, 674, 748, 831, 918, 1014, 1115, 1226, 1360, 1540, 1729, 1945, 2172, 2432, 2702, 3009 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 115.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

CROSSREFS

Cf. A008289.

Sequence in context: A035448 A060969 A152162 * A083802 A100881 A053263

Adjacent sequences:  A030696 A030697 A030698 * A030700 A030701 A030702

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jan 23 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 16 20:12 EST 2012. Contains 205962 sequences.