|
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
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+ln(m)^2" since n^2<ln(n^n)^2=n^2*ln(n)^2.
|
|
|
PROG
| (PARI) for(n=1, 65, print1(sum(i=n^n, n^n+n^2, isprime(i)), ", "))
|
|
|
CROSSREFS
| Sequence in context: A066202 A027420 A116588 * A072211 A070306 A014665
Adjacent sequences: A069919 A069920 A069921 * A069923 A069924 A069925
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), May 05 2002
|
| |
|
|
