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.

A248373 Partial sums of primes of form n^2 + (n+1)^2 + (n+2)^2 (A027864).

This page as a plain text file.
%I A248373 #18 Nov 24 2017 10:51:31
%S A248373 5,34,183,692,1369,3246,6923,15352,25101,37010,50479,68268,90977,
%T A248373 118054,146283,191672,238549,291618,361847,433924,515601,616070,
%U A248373 718747,832824,961373,1102642,1257231,1437308,1629337,1824414,2031923,2255512,2485701,2746778,3059767
%N A248373 Partial sums of primes of form n^2 + (n+1)^2 + (n+2)^2 (A027864).
%H A248373 Harvey P. Dale, <a href="/A248373/b248373.txt">Table of n, a(n) for n = 1..1000</a>
%t A248373 f[x_]:=x^2+(x+1)^2+(x+2)^2;
%t A248373 n=50;result={};counter=0;number=0;
%t A248373 While[counter<n,value=f[number];
%t A248373 If[PrimeQ[value]==True,AppendTo[result,value];counter=counter+1];
%t A248373 number=number+1];sumresult={};sum=0;index = 1;
%t A248373 While[index<=n,sum=sum+result[[index]];AppendTo[sumresult,sum];index=index+1];sumresult
%t A248373 Accumulate[Select[Total/@Partition[Range[0,400]^2,3,1],PrimeQ]] (* _Harvey P. Dale_, Nov 24 2017 *)
%o A248373 (PARI) lista(nn) = {s = 0; for (n=0, nn, if (isprime(p=n^2 + (n+1)^2 + (n+2)^2), s +=p; print1(s, ", ")););} \\ _Michel Marcus_, Oct 06 2014
%Y A248373 Cf. A027864.
%K A248373 nonn
%O A248373 1,1
%A A248373 _Michael Savoric_, Oct 05 2014