login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A340966
Number of ways to write n as an ordered sum of 10 primes.
11
1, 10, 45, 130, 300, 622, 1185, 2100, 3495, 5480, 8266, 12100, 17140, 23730, 32155, 42802, 56400, 73180, 93820, 119250, 149872, 187090, 231765, 284490, 347335, 421332, 507580, 608840, 725500, 859450, 1014473, 1190700, 1392100, 1621710, 1879950, 2172610, 2503580
OFFSET
20,2
LINKS
FORMULA
G.f.: (Sum_{k>=1} x^prime(k))^10.
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, 10):
seq(a(n), n=20..56); # Alois P. Heinz, Jan 31 2021
MATHEMATICA
nmax = 56; CoefficientList[Series[Sum[x^Prime[k], {k, 1, nmax}]^10, {x, 0, nmax}], x] // Drop[#, 20] &
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 31 2021
STATUS
approved