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
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,17

LINKS

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

FORMULA

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

PROG

(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

CROSSREFS

Cf. A024937.

Cf. A099773, A000586.

Sequence in context: A110102 A255472 A230198 * A024937 A143977 A115265

Adjacent sequences:  A024936 A024937 A024938 * A024940 A024941 A024942

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Corrected and extended by Vladeta Jovovic, Jul 20 2003

STATUS

approved

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 April 22 16:32 EDT 2021. Contains 343177 sequences. (Running on oeis4.)