A024937 - OEIS

This site is supported by donations to The OEIS Foundation.

A024937

a(n) = number of 2's in all partitions of n into distinct primes.

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, 58, 63, 64 (list; graph; refs; listen; history; internal format)

	OFFSET	`7,12`
	FORMULA	`G.f.: x^2*Product_{k>1} (1+x^prime(k)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 20 2003`
	CROSSREFS	`Cf. A024939.` `Sequence in context: A025819 A110102 A024939 * A143977 A115265 A105223` `Adjacent sequences: A024934 A024935 A024936 * A024938 A024939 A024940`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 20 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:25 EST 2012. Contains 205777 sequences.