login
A282062
Expansion of (x + Sum_{p prime, k>=1} x^(p^k))^2.
12
0, 0, 1, 2, 3, 4, 5, 4, 5, 6, 7, 6, 8, 6, 7, 6, 7, 6, 9, 6, 10, 8, 7, 4, 10, 6, 9, 8, 10, 6, 12, 6, 13, 10, 13, 8, 14, 4, 11, 8, 12, 6, 12, 6, 12, 10, 11, 4, 16, 6, 15, 8, 12, 4, 17, 6, 14, 8, 11, 4, 16, 6, 13, 8, 13, 6, 18, 4, 16, 10, 14, 4, 20, 6, 15, 12, 14, 6, 18, 4, 18, 8, 13, 8, 22, 6, 17, 8, 14, 6, 24, 8, 16, 6, 13, 4
OFFSET
0,4
COMMENTS
Number of ways to write n as an ordered sum of two prime powers (1 included).
LINKS
Eric Weisstein's World of Mathematics, Prime Power
FORMULA
G.f.: (x + Sum_{p prime, k>=1} x^(p^k))^2.
EXAMPLE
a(8) = 5 because we have [7, 1], [5, 3], [4, 4], [3, 5] and [1, 7].
MAPLE
N:= 100: # to get a(0)..a(N)
P:= select(isprime, [$2..N]):
g:= x + add(add(x^(p^k), k=1..floor(log[p](N))), p=P):
S:= series(g^2, x, N+1):
seq(coeff(S, x, n), n=0..N); # Robert Israel, Feb 10 2017
MATHEMATICA
nmax = 95; CoefficientList[Series[(x + Sum[Floor[1/PrimeNu[k]] x^k, {k, 2, nmax}])^2, {x, 0, nmax}], x]
KEYWORD
nonn,look
AUTHOR
Ilya Gutkovskiy, Feb 05 2017
STATUS
approved