|
Search: id:A064688
|
|
|
| A064688 |
|
Number of partitions of primes into distinct (also odd) parts. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) = A000009(A000040(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 27 2002
|
|
FORMULA
|
a(n) = t(prime(n), 0), t as defined in A079211.
|
|
PROGRAM
|
A := mul(1+x^m, m=1..100); A000009 := n->coeff(A, x, n); A064688:=n->A000009(ithprime(n));
(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)), ", "))
|
|
CROSSREFS
|
Cf. A000009, A000040, A123557.
Sequence in context: A002139 A140489 A051915 this_sequence A089891 A004689 A124370
Adjacent sequences: A064685 A064686 A064687 this_sequence A064689 A064690 A064691
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Oct 11 2001
|
|
|
Search completed in 0.002 seconds
|
