This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A340963 #8 Jan 31 2021 22:22:07 %S A340963 1,7,21,42,77,133,210,316,434,574,770,980,1239,1547,1876,2331,2828, %T A340963 3367,4032,4746,5565,6574,7602,8757,10136,11480,13132,14882,16646, %U A340963 18662,20951,23268,26082,28861,31787,35218,38745,42532,46403,50883,54810,60613,65016,71302,76069 %N A340963 Number of ways to write n as an ordered sum of 7 primes. %H A340963 Alois P. Heinz, <a href="/A340963/b340963.txt">Table of n, a(n) for n = 14..10000</a> %F A340963 G.f.: (Sum_{k>=1} x^prime(k))^7. %p A340963 b:= proc(n, k) option remember; local r, p; r, p:= 0, 2; %p A340963 if n=0 then `if`(k=0, 1, 0) elif k<1 then 0 else %p A340963 while p<=n do r:= r+b(n-p, k-1); p:= nextprime(p) od; r fi %p A340963 end: %p A340963 a:= n-> b(n, 7): %p A340963 seq(a(n), n=14..58); # _Alois P. Heinz_, Jan 31 2021 %t A340963 nmax = 58; CoefficientList[Series[Sum[x^Prime[k], {k, 1, nmax}]^7, {x, 0, nmax}], x] // Drop[#, 14] & %Y A340963 Column k=7 of A121303. %Y A340963 Cf. A000040, A010051, A073610, A098238, A259197, A340960, A340961, A340962, A340964, A340965, A340966. %K A340963 nonn %O A340963 14,2 %A A340963 _Ilya Gutkovskiy_, Jan 31 2021