|
%I #13 Jul 11 2015 01:31:52
%S 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,
%T 7,9,13,13,7,10,11,11,9,13,11,10,15,10,11,10,19,14,16,11,16,21,20,12,
%U 9,15,21,12,10,16,15,22,19,17,18,12,19,20,13,17,13,13,17,23
%N Number of primes p such that n^n <= p <= n^n + n^2.
%C 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.
%o (PARI) for(n=1,65,print1(sum(i=n^n,n^n+n^2,isprime(i)),","))
%Y Cf. A000040, A216266, A217317.
%K easy,nonn
%O 1,2
%A _Benoit Cloitre_, May 05 2002
%E a(66)-a(76) from _Alex Ratushnyak_, Apr 20 2014
|
