|
|
A071868
|
|
Number of k (1 <= k <= n) such that k^2+1 is prime.
|
|
0
|
|
|
1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
Hardy and Littlewood conjectured that : a(n) ~ c* sqrt(n)/Log(n) where c = prod(p prime, 1 - (-1)^((p-1)/2)/(p-1) ) = 1, 3727...
|
|
MATHEMATICA
|
Accumulate[Table[If[PrimeQ[k^2+1], 1, 0], {k, 80}]] (* Harvey P. Dale, Jan 08 2020 *)
|
|
PROG
|
(PARI) for(n=1, 200, print1(sum(i=1, n, if(isprime(i^2+1)-1, 0, 1)), ", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|