A099773 Number of partitions of n into odd prime parts.

1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 5, 5, 6, 7, 7, 9, 10, 11, 12, 14, 15, 17, 20, 21, 24, 26, 29, 33, 35, 40, 44, 47, 53, 58, 64, 70, 77, 84, 91, 101, 110, 120, 130, 142, 155, 168, 184, 199, 215, 234, 254, 275, 298, 323, 348, 376, 407, 439, 474, 511, 551, 592

Offset: 0

Author

Vladeta Jovovic, Nov 11 2004

Keywords

• easy
• nonn

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..5000

Crossrefs

Cf. A000607, A024939.

Programs

Haskell

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

Mathematica

CoefficientList[ Series[ Product[1/(1 - x^Prime[i]), {i, 2, 25}], {x, 0, 70}], x] (* Robert G. Wilson v, Jun 14 2006 *)

Formula

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