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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A298604 Number of partitions of n into distinct odd prime parts (including 1). 2
1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 6, 5, 5, 6, 6, 7, 7, 8, 9, 8, 9, 10, 11, 12, 11, 12, 14, 14, 15, 16, 17, 17, 17, 20, 22, 21, 22, 24, 25, 27, 28, 30, 31, 31, 33, 36, 39, 40, 40, 42, 46, 47, 49, 53, 54, 55, 58, 63, 67, 68, 70, 73, 77, 81, 84 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

LINKS

Table of n, a(n) for n=0..78.

Index entries for related partition-counting sequences

FORMULA

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

EXAMPLE

a(16) = 3 because we have [13, 3], [11, 5] and [7, 5, 3, 1].

MATHEMATICA

nmax = 78; CoefficientList[Series[(1 + x) Product[(1 + x^Prime[k]), {k, 2, nmax}], {x, 0, nmax}], x]

CROSSREFS

Cf. A000586, A006005, A008578, A024939, A036497, A298603.

Sequence in context: A123584 A291983 A112689 * A190353 A331904 A025829

Adjacent sequences: A298601 A298602 A298603 * A298605 A298606 A298607

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Jan 22 2018

STATUS

approved

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 December 6 05:22 EST 2022. Contains 358594 sequences. (Running on oeis4.)