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.

A340962 Number of ways to write n as an ordered sum of 6 primes.

This page as a plain text file.
%I A340962 #8 Jan 31 2021 22:12:06
%S A340962 1,6,15,26,45,72,106,150,186,236,306,366,455,540,636,782,912,1056,
%T A340962 1236,1410,1617,1896,2106,2400,2696,2976,3348,3716,4026,4446,4917,
%U A340962 5340,5982,6380,7017,7476,8377,8640,9765,9936,11202,11496,13132,12930,15117,14672,17178,16800,19696
%N A340962 Number of ways to write n as an ordered sum of 6 primes.
%H A340962 Alois P. Heinz, <a href="/A340962/b340962.txt">Table of n, a(n) for n = 12..10000</a>
%F A340962 G.f.: (Sum_{k>=1} x^prime(k))^6.
%p A340962 b:= proc(n, k) option remember; local r, p; r, p:= 0, 2;
%p A340962       if n=0 then `if`(k=0, 1, 0) elif k<1 then 0 else
%p A340962       while p<=n do r:= r+b(n-p, k-1); p:= nextprime(p) od; r fi
%p A340962     end:
%p A340962 a:= n-> b(n, 6):
%p A340962 seq(a(n), n=12..60);  # _Alois P. Heinz_, Jan 31 2021
%t A340962 nmax = 60; CoefficientList[Series[Sum[x^Prime[k], {k, 1, nmax}]^6, {x, 0, nmax}], x] // Drop[#, 12] &
%Y A340962 Column k=6 of A121303.
%Y A340962 Cf. A000040, A010051, A073610, A098238, A259196, A340960, A340961, A340963, A340964, A340965, A340966.
%K A340962 nonn
%O A340962 12,2
%A A340962 _Ilya Gutkovskiy_, Jan 31 2021