login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024939 Number of partitions of n into distinct odd primes. 8

%I

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

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

%U 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

%N Number of partitions of n into distinct odd primes.

%H T. D. Noe, <a href="/A024939/b024939.txt">Table of n, a(n) for n = 0..1000</a>

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

%o (Haskell)

%o a024939 = p a065091_list where

%o p _ 0 = 1

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

%o -- _Reinhard Zumkeller_, Aug 05 2012

%Y Cf. A024937.

%Y Cf. A099773, A000586.

%K nonn

%O 0,17

%A _Clark Kimberling_

%E Corrected and extended by _Vladeta Jovovic_, Jul 20 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 02:20 EDT 2021. Contains 343636 sequences. (Running on oeis4.)