id:A025148 - OEIS Search Results

Search: id:A025148

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct parts >= 3.

+0
5

1, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 10, 12, 15, 17, 20, 24, 28, 32, 38, 44, 51, 59, 68, 78, 91, 103, 118, 136, 155, 176, 201, 228, 259, 294, 332, 375, 425, 478, 538, 607, 681, 764, 858, 961, 1075, 1203, 1343, 1499, 1673, 1863, 2073, 2308, 2564, 2847, 3161, 3504 (list; graph; listen)

	OFFSET	`0,8`
	FORMULA	`G.f.: Product_{k=3..inf} (1+x^k).` `a(n)=A096749(n+2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008` `G.f.: product_{j=3..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008`
	MAPLE	`sys := {L = PowerSet(Sequence(Z, card>2)) }, unlabeled:seq(count([L, sys], size=i), i=0..56); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 08 2007`
	CROSSREFS	`Cf. A025147.` `Cf. A025147.` `Sequence in context: A046676 A003114 A026823 this_sequence A096749 A036821 A026798` `Adjacent sequences: A025145 A025146 A025147 this_sequence A025149 A025150 A025151`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research