|
%I #10 Nov 28 2017 08:31:43
%S 2,2,7,103,1619,28687,567871,12579617,310248241,8448283757,
%T 252097800623,8187297276401,287629183566841,10871811891162227,
%U 440023773804299591
%N Prime numbers at large subscripts: a(n) = prime(n^n).
%C The n^n-th prime. - _Hugo Pfoertner_, Nov 28 2017
%H Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation</a>.
%F a(n) = A000040(A000312(n)).
%e a(10) = prime(10000000000) = 252097800623.
%Y Cf. A000040, A000312, A002110, A000142, A000079, A033844.
%K hard,nonn
%O 0,1
%A _Labos Elemer_, Jul 09 2001
%E a(12)-a(14) from _Hugo Pfoertner_, Nov 28 2017
|
