Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A340965
Number of ways to write n as an ordered sum of 9 primes.
11
1, 9, 36, 93, 198, 387, 696, 1170, 1845, 2740, 3960, 5562, 7566, 10125, 13248, 17133, 22014, 27774, 34776, 43173, 53010, 64869, 78696, 94617, 113415, 134946, 159552, 188164, 219960, 256041, 297180, 342846, 394614, 452595, 516276, 587997, 667938, 755109, 852444
OFFSET
18,2
LINKS
FORMULA
G.f.: (Sum_{k>=1} x^prime(k))^9.
MAPLE
b:= proc(n, k) option remember; local r, p; r, p:= 0, 2;
if n=0 then `if`(k=0, 1, 0) elif k<1 then 0 else
while p<=n do r:= r+b(n-p, k-1); p:= nextprime(p) od; r fi
end:
a:= n-> b(n, 9):
seq(a(n), n=18..56); # Alois P. Heinz, Jan 31 2021
MATHEMATICA
nmax = 56; CoefficientList[Series[Sum[x^Prime[k], {k, 1, nmax}]^9, {x, 0, nmax}], x] // Drop[#, 18] &
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 31 2021
STATUS
approved