id:A118457 - OEIS Search Results

Search: id:A118457

Displaying 1-1 of 1 results found.

page 1

Table of partitions of n into distinct parts, in Mathematica ordering.

+0
4

1, 2, 3, 2, 1, 4, 3, 1, 5, 4, 1, 3, 2, 6, 5, 1, 4, 2, 3, 2, 1, 7, 6, 1, 5, 2, 4, 3, 4, 2, 1, 8, 7, 1, 6, 2, 5, 3, 5, 2, 1, 4, 3, 1, 9, 8, 1, 7, 2, 6, 3, 6, 2, 1, 5, 4, 5, 3, 1, 4, 3, 2, 10, 9, 1, 8, 2, 7, 3, 7, 2, 1, 6, 4, 6, 3, 1, 5, 4, 1, 5, 3, 2, 4, 3, 2, 1, 11, 10, 1, 9, 2, 8, 3, 8, 2, 1, 7, 4, 7, 3, 1, 6, 5 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`The partitions of 5 into distinct parts are [5], [4,1], and [3,2], so row 5 is 5,4,1,3,2.`
	CROSSREFS	`Cf. A026793, A118459 (partition lengths), A015723 (total row lengths), A080577, A000009.` `Sequence in context: A060475 A106559 A106377 this_sequence A129773 A105789 A076549` `Adjacent sequences: A118454 A118455 A118456 this_sequence A118458 A118459 A118460`
	KEYWORD	`nonn,tabf`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 28 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research