login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218209 Number of n-digit primes that are of the form (k-2)^2 + (k-1)^2 + k^2 4

%I #9 Oct 17 2016 15:24:10

%S 2,1,3,4,12,31,86,230,681,1934,5634,15772

%N Number of n-digit primes that are of the form (k-2)^2 + (k-1)^2 + k^2

%F a(n) = A218210(n) - A218210(n-1)

%t n = -1; Table[cnt = 0; While[n++; p = 3*n^2 + 2; p < 10^e, If[PrimeQ[p], cnt++]]; n--; cnt, {e, 10}] (* _T. D. Noe_, Oct 23 2012 *)

%t Table[Count[Table[Total[Range[n,n+2]^2],{n,-1,600000}],_?(PrimeQ[#] && IntegerLength[#]==k&)],{k,12}] (* _Harvey P. Dale_, Oct 17 2016 *)

%Y Cf. A027863, A027864, A218207, A218210, A218211.

%K nonn,base

%O 1,1

%A _Martin Renner_, Oct 23 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:25 EDT 2024. Contains 371964 sequences. (Running on oeis4.)