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!)
A064688 a(n) = number of partitions of primes into distinct (also odd) parts. 16
1, 2, 3, 5, 12, 18, 38, 54, 104, 256, 340, 760, 1260, 1610, 2590, 5120, 9792, 12076, 22250, 32992, 40026, 70488, 101698, 173682, 345856, 483330, 570078, 789640, 927406, 1274118, 3725410, 5010688, 7755776, 8953856, 18108418, 20792120 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = t(prime(n), 0), t as defined in A079211.
a(n) = A000009(A000040(n)). - Reinhard Zumkeller, Dec 27 2002
MAPLE
A := mul(1+x^m, m=1..100); A000009 := n->coeff(A, x, n); A064688:=n->A000009(ithprime(n));
MATHEMATICA
a[n_]:=PartitionsQ[Prime[n]]; (* Vladimir Joseph Stephan Orlovsky, Dec 05 2008 *)
PROG
(PARI) q(n) = polcoeff(prod(k=1, n, 1+x^k, 1+x*O(x^n)), n) for(n=1, 50, print1(q(prime(n)), ", "))
(PARI) q(n)= { polcoeff(prod(k=1, n, 1 + x^k, 1 + x*O(x^n)), n) } { for (n = 1, 400, write("b064688.txt", n, " ", q(prime(n))) ) } \\ Harry J. Smith, Sep 22 2009
CROSSREFS
Sequence in context: A331101 A193776 A051915 * A089891 A282237 A004689
KEYWORD
nonn
AUTHOR
Jason Earls, Oct 11 2001
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 August 12 23:59 EDT 2024. Contains 375113 sequences. (Running on oeis4.)