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.

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

This page as a plain text file.
%I A341986 #8 Feb 25 2021 15:23:48
%S A341986 1,7,28,77,168,308,511,785,1155,1603,2142,2723,3430,4207,5202,6216,
%T A341986 7497,8729,10451,12061,14350,16205,19033,21182,24934,27482,32109,
%U A341986 34587,40139,42714,49791,52290,60718,62699,73297,75278,88571,89488,104993,104482,123760,122066
%N A341986 Number of ways to write n as an ordered sum of 7 primes (counting 1 as a prime).
%H A341986 Alois P. Heinz, <a href="/A341986/b341986.txt">Table of n, a(n) for n = 7..10000</a>
%F A341986 G.f.: ( x + Sum_{k>=1} x^prime(k) )^7.
%p A341986 b:= proc(n) option remember; series(`if`(n=0, 1, x*add(
%p A341986       `if`(j=1 or isprime(j), b(n-j), 0), j=1..n)), x, 8)
%p A341986     end:
%p A341986 a:= n-> coeff(b(n), x, 7):
%p A341986 seq(a(n), n=7..48);  # _Alois P. Heinz_, Feb 25 2021
%t A341986 nmax = 48; CoefficientList[Series[(x + Sum[x^Prime[k], {k, 1, nmax}])^7, {x, 0, nmax}], x] // Drop[#, 7] &
%Y A341986 Cf. A008578, A280917, A283762, A340963, A341950, A341978, A341982, A341983, A341984, A341985, A341987, A341988, A341989.
%K A341986 nonn
%O A341986 7,2
%A A341986 _Ilya Gutkovskiy_, Feb 24 2021