id:A024939 - OEIS Search Results

Search: id:A024939

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct odd primes.

+0
4

1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 4, 3, 5, 4, 4, 5, 5, 6, 6, 5, 7, 7, 7, 8, 8, 9, 8, 9, 11, 11, 10, 12, 12, 13, 14, 14, 16, 15, 16, 17, 19, 20, 20, 20, 22, 24, 23, 26, 27, 27, 28, 30, 33, 34, 34, 36, 37, 40, 41, 43, 46, 46, 47, 50, 55, 56, 56 (list; graph; listen)

	OFFSET	`0,17`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..1000`
	FORMULA	`G.f.: Product_{k>1} (1+x^prime(k)).`
	CROSSREFS	`Cf. A024937.` `Sequence in context: A055175 A025819 A110102 this_sequence A024937 A143977 A115265` `Adjacent sequences: A024936 A024937 A024938 this_sequence A024940 A024941 A024942`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`
	EXTENSIONS	`Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 20 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research