id:A046155 - OEIS Search Results

Search: id:A046155

Displaying 1-1 of 1 results found.

page 1

k that maximizes partitions of n into exactly k parts.

+0
2

0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15 (list; graph; listen)

	OFFSET	`0,5`
	COMMENT	`Essentially the same as A026819. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 18 2008]`
	CROSSREFS	`A002569(n) = partitions of n into exactly a(n) parts.` `Sequence in context: A122651 A130535 A026819 this_sequence A137214 A081832 A034887` `Adjacent sequences: A046152 A046153 A046154 this_sequence A046156 A046157 A046158`
	KEYWORD	`nonn`
	AUTHOR	`Dave Wilson`

page 1

Search completed in 0.002 seconds

Last modified November 25 13:47 EST 2009. Contains 167481 sequences.

AT&T Labs Research