[go: up one dir, main page]

login
Search: a281422 -id:a281422
     Sort: relevance | references | number | modified | created      Format: long | short | data
Expansion of (Sum_{k>=1} x^prime(prime(k)))^2 [even terms only].
+10
1
0, 0, 0, 1, 2, 1, 0, 2, 2, 0, 2, 3, 0, 0, 2, 0, 0, 3, 2, 0, 0, 2, 2, 2, 2, 0, 2, 0, 0, 2, 0, 3, 2, 0, 0, 4, 4, 0, 2, 2, 0, 1, 2, 2, 2, 2, 0, 2, 0, 2, 4, 0, 0, 0, 2, 0, 2, 4, 0, 1, 2, 0, 2, 4, 0, 2, 2, 1, 0, 2, 2, 2, 2, 0, 0, 4, 0, 0, 0, 2, 2, 2, 0, 1, 6, 0, 0, 2, 2, 0, 0, 2, 2, 2, 2, 2, 2, 4, 4, 2, 0, 2, 0, 0, 2, 4, 0, 2, 4, 1, 2, 4
OFFSET
0,5
COMMENTS
Number of ways to write 2n as an ordered sum of two primes with prime subscripts (A006450).
FORMULA
G.f.: (Sum_{k>=1} x^prime(prime(k)))^2 [even terms only].
EXAMPLE
a(4) = 2 because we have [3, 5] and [5, 3], where 3 = prime(2) = prime(prime(1)) and 5 = prime(3) = prime(prime(2)).
MATHEMATICA
Take[CoefficientList[Series[Sum[x^Prime[Prime[k]], {k, 1, 250}]^2, {x, 0, 250}], x], {1, -1, 2}]
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 21 2017
STATUS
approved

Search completed in 0.007 seconds