id:A096765 - OEIS Search Results

Search: id:A096765

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct parts, the least being 1.

+0
2

0, 1, 0, 1, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 10, 12, 15, 17, 21, 25, 29, 35, 41, 48, 56, 66, 76, 89, 103, 119, 137, 159, 181, 209, 239, 273, 312, 356, 404, 460, 522, 591, 669, 757, 853, 963, 1085, 1219, 1371, 1539, 1725, 1933, 2164, 2418, 2702, 3016, 3362, 3746, 4171, 4637 (list; graph; listen)

	OFFSET	`0,7`
	COMMENT	`The old entry with this sequence number was a duplicate of A071569.`
	FORMULA	`a(n)=A025147(n-1), n>1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: x*product_{j=2..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A109763 A119620 A029018 this_sequence A025147 A032230 A126793` `Adjacent sequences: A096762 A096763 A096764 this_sequence A096766 A096767 A096768`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Sep 28 2008`

page 1

Search completed in 0.003 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research