login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099773 Number of partitions of n into odd prime parts. 11

%I #11 Jan 26 2018 20:00:20

%S 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,

%T 21,24,26,29,33,35,40,44,47,53,58,64,70,77,84,91,101,110,120,130,142,

%U 155,168,184,199,215,234,254,275,298,323,348,376,407,439,474,511,551,592

%N Number of partitions of n into odd prime parts.

%H Alois P. Heinz, <a href="/A099773/b099773.txt">Table of n, a(n) for n = 0..5000</a>

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

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

%o (Haskell)

%o a099773 = p a065091_list where

%o p _ 0 = 1

%o p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m

%o -- _Reinhard Zumkeller_, Aug 05 2012

%Y Cf. A000607, A024939.

%K easy,nonn

%O 0,11

%A _Vladeta Jovovic_, Nov 11 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:41 EDT 2024. Contains 371906 sequences. (Running on oeis4.)