id:A030699 - OEIS Search Results

Search: id:A030699

Displaying 1-1 of 1 results found.

page 1

Maximal value of Q(n,m) (number of partitions of n into m distinct summands) for given n.

+0
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; listen)

	OFFSET	`1,5`
	REFERENCES	`L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 115.`
	CROSSREFS	`Cf. A008289.` `Sequence in context: A035448 A060969 A152162 this_sequence A083802 A100881 A053263` `Adjacent sequences: A030696 A030697 A030698 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research