Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Nov 16 2019 20:09:24
%S 0,3,3,2,2,2,3,2,2,1,0,1,3,3,1,2,1,0,6,1,2,2,3,1,1,3,3,1,0,3,2,4,2,2,
%T 4,3,2,1,5,1,1,2,3,1,3,0,2,1,3,2,1,0,4,1,2,2,2,2,1,0,1,3,2,1,0,0,2,1,
%U 3,1,1,2,1,0,2,3,5,3,3,0,3,2,2,4,4,0,6,2,1,2,1,3,3,2,1,3,2,2,1,4,1,6,0,2,1
%N Number of primes in the neighborhood of n^n with radius ceiling(log(n^n)).
%F a(n) almost equals A096509(n^n) >= a(n) because here only primes are counted, the true prime powers not.
%e a(3)=3 and the 3 primes in [23,31] are {23,29,31}.
%Y Cf. A096509-A096523, A096830-A096840.
%K nonn
%O 1,2
%A _Labos Elemer_, Jul 14 2004