A024939 Number of partitions of n into distinct odd primes.

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

Offset: 0

Author

Clark Kimberling

Keywords

• nonn

Links

• T. D. Noe, Table of n, a(n) for n = 0..1000

Crossrefs

Cf. A024937.

Cf. A099773, A000586.

Programs

Haskell

a024939 = p a065091_list where
   p _  0 = 1
   p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
-- Reinhard Zumkeller, Aug 05 2012

Formula

G.f.: Product_{k>1} (1+x^prime(k)).

Extensions

Corrected and extended by Vladeta Jovovic, Jul 20 2003