cp's OEIS Frontend

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.

A341989 Number of ways to write n as an ordered sum of 10 primes (counting 1 as a prime).

This page as a plain text file.
%I A341989 #6 Feb 25 2021 15:25:01
%S A341989 1,10,55,210,625,1542,3310,6390,11400,19090,30353,46060,67210,94780,
%T A341989 130230,174862,230650,298800,382115,482090,603373,746860,918770,
%U A341989 1118100,1355110,1626742,1949190,2312380,2740220,3212640,3769784,4375900,5092485,5854680,6758935,7703112
%N A341989 Number of ways to write n as an ordered sum of 10 primes (counting 1 as a prime).
%F A341989 G.f.: ( x + Sum_{k>=1} x^prime(k) )^10.
%p A341989 b:= proc(n) option remember; series(`if`(n=0, 1, x*add(
%p A341989       `if`(j=1 or isprime(j), b(n-j), 0), j=1..n)), x, 11)
%p A341989     end:
%p A341989 a:= n-> coeff(b(n), x, 10):
%p A341989 seq(a(n), n=10..45);  # _Alois P. Heinz_, Feb 25 2021
%t A341989 nmax = 45; CoefficientList[Series[(x + Sum[x^Prime[k], {k, 1, nmax}])^10, {x, 0, nmax}], x] // Drop[#, 10] &
%Y A341989 Cf. A008578, A280917, A283762, A340966, A341972, A341981, A341982, A341983, A341984, A341985, A341986, A341987, A341988.
%K A341989 nonn
%O A341989 10,2
%A A341989 _Ilya Gutkovskiy_, Feb 24 2021