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.
n = 0; cnt = 0; Table[While[n++; p = 2*n^2 - 2*n + 1; p < 10^e, If[PrimeQ[p], cnt++]]; n--; cnt, {e, 10}] (* T. D. Noe, Oct 23 2012 *)
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 *)
Table[Count[Table[Total[Range[n,n+2]^2],{n,-1,600000}],?(PrimeQ[#] && IntegerLength[#]==k&)],{k,12}] (* _Harvey P. Dale, Oct 17 2016 *)
n = 0; cnt = 0; Table[While[n++; p = 91 + 42*n + 6*n^2; p < 10^e, If[PrimeQ[p], cnt++]]; n--; cnt, {e, 14}] (* T. D. Noe, Oct 23 2012, edited by Michael De Vlieger, Feb 18 2018 *)
a(1) = 1 because only one prime less than 10 can be represented as a sum of consecutive squares, namely 5 = 1^2 + 2^2. a(2) = 5 because there are five primes less than 100 representable as a sum of consecutive squares: the aforementioned 5, as well as 13 = 2^2 + 3^2, 29 = 2^2 + 3^2 + 4^2, 41 = 4^2 + 5^2 and 61 = 5^2 + 6^2.
nn = 8; nMax = 10^nn; t = Table[0, {nn}]; Do[k = n; s = 0; While[s = s + k^2; s <= nMax, If[PrimeQ[s], t[[Ceiling[Log[10, s]]]]++]; k++], {n, Sqrt[nMax]}]; Accumulate[t] (* T. D. Noe, Oct 23 2012 *)
Comments