login
A069922
Number of primes p such that n^n <= p <= n^n + n^2.
0
1, 2, 2, 4, 1, 5, 4, 1, 2, 5, 1, 4, 4, 9, 7, 6, 2, 4, 7, 9, 7, 3, 7, 10, 10, 6, 12, 6, 10, 7, 8, 10, 7, 9, 13, 13, 7, 10, 11, 11, 9, 13, 11, 10, 15, 10, 11, 10, 19, 14, 16, 11, 16, 21, 20, 12, 9, 15, 21, 12, 10, 16, 15, 22, 19, 17, 18, 12, 19, 20, 13, 17, 13, 13, 17, 23
OFFSET
1,2
COMMENTS
Question: for any n>0, is there at least one prime p such that n^n <= p <= n^n + n^2? In this case, that would be stronger than the Schinzel conjecture: "for m > 1 there's at least one prime p such that m <= p <= m + log(m)^2" since n^2 < log(n^n)^2 = n^2*log(n)^2.
PROG
(PARI) for(n=1, 65, print1(sum(i=n^n, n^n+n^2, isprime(i)), ", "))
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, May 05 2002
EXTENSIONS
a(66)-a(76) from Alex Ratushnyak, Apr 20 2014
STATUS
approved