login
Number of ways to write n as an ordered sum of 9 primes.
11

%I #10 Mar 18 2022 18:39:53

%S 1,9,36,93,198,387,696,1170,1845,2740,3960,5562,7566,10125,13248,

%T 17133,22014,27774,34776,43173,53010,64869,78696,94617,113415,134946,

%U 159552,188164,219960,256041,297180,342846,394614,452595,516276,587997,667938,755109,852444

%N Number of ways to write n as an ordered sum of 9 primes.

%H Seiichi Manyama, <a href="/A340965/b340965.txt">Table of n, a(n) for n = 18..10000</a>

%F G.f.: (Sum_{k>=1} x^prime(k))^9.

%p b:= proc(n, k) option remember; local r, p; r, p:= 0, 2;

%p if n=0 then `if`(k=0, 1, 0) elif k<1 then 0 else

%p while p<=n do r:= r+b(n-p, k-1); p:= nextprime(p) od; r fi

%p end:

%p a:= n-> b(n, 9):

%p seq(a(n), n=18..56); # _Alois P. Heinz_, Jan 31 2021

%t nmax = 56; CoefficientList[Series[Sum[x^Prime[k], {k, 1, nmax}]^9, {x, 0, nmax}], x] // Drop[#, 18] &

%Y Column k=9 of A121303.

%Y Cf. A000040, A010051, A073610, A098238, A259200, A340960, A340961, A340962, A340963, A340964, A340966.

%K nonn

%O 18,2

%A _Ilya Gutkovskiy_, Jan 31 2021