|
Search: id:A117929
|
|
|
| A117929 |
|
Number of partitions of n into 2 distinct primes. |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 0, 2, 1, 2, 1, 2, 0, 3, 1, 2, 0, 2, 0, 3, 1, 2, 1, 3, 0, 4, 0, 1, 1, 3, 0, 4, 1, 3, 1, 3, 0, 5, 1, 4, 0, 3, 0, 5, 1, 3, 0, 3, 0, 6, 1, 2, 1, 5, 0, 6, 0, 2, 1, 5, 0, 6, 1, 4, 1, 5, 0, 7, 0, 4, 1, 4, 0, 8, 1, 4, 0, 4, 0, 9, 1, 4, 0, 4, 0, 7, 0, 3, 1, 6, 0, 8, 1, 5, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,16
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
FORMULA
|
G.f.=sum(sum(x^(p(i)+p(j)), i=1..j-1), j=1..infinity), where p(k) is the k-th prime.
|
|
EXAMPLE
|
a(24)=3 because we have [19,5],[17,7], and [13,11].
|
|
MAPLE
|
g:=sum(sum(x^(ithprime(i)+ithprime(j)), i=1..j-1), j=1..35): gser:=series(g, x=0, 130): seq(coeff(gser, x, n), n=1..125);
|
|
CROSSREFS
|
Cf. A061358.
Sequence in context: A070824 A071459 A070288 this_sequence A107455 A039701 A025822
Adjacent sequences: A117926 A117927 A117928 this_sequence A117930 A117931 A117932
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 03 2006
|
|
|
Search completed in 0.002 seconds
|
