|
Search: id:A069259
|
|
|
| A069259 |
|
Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity. |
|
+0
2
|
|
| 1, 1, 2, 4, 5, 8, 12, 16, 22, 31, 41, 53, 70, 90, 113, 147, 184, 226, 286, 352, 429, 530, 644, 776, 943, 1135, 1352, 1623, 1934, 2283, 2716, 3207, 3759, 4431, 5191, 6050, 7074, 8236, 9543, 11079, 12829, 14786, 17066, 19659, 22547, 25895, 29683, 33897
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(n) is the number of ways to express 2*n as a sum of parts x such that x+2 is an odd prime. - David Wasserman (wasserma(AT)spawar.navy.mil), Apr 03 2003
|
|
FORMULA
|
G.f.: (A(sqrt(x))+A(-sqrt(x)))/2, where A(x) = 1/Product_{k>1} (1-x^(prime(k)-2)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 12 2004
|
|
CROSSREFS
|
Cf. A069258.
Sequence in context: A063465 A035001 A092268 this_sequence A102186 A039842 A116901
Adjacent sequences: A069256 A069257 A069258 this_sequence A069260 A069261 A069262
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 10 2002
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Apr 03 2003
|
|
|
Search completed in 0.005 seconds
|
