A062448 Prime numbers at large subscripts: a(n) = prime(n^n).

2, 2, 7, 103, 1619, 28687, 567871, 12579617, 310248241, 8448283757, 252097800623, 8187297276401, 287629183566841, 10871811891162227, 440023773804299591

Offset: 0

Author

Labos Elemer, Jul 09 2001

Keywords

• hard
• nonn

Comments

The n^n-th prime. - Hugo Pfoertner, Nov 28 2017

Examples

			a(10) = prime(10000000000) = 252097800623.
		

Links

• Kim Walisch, Fast C++ prime counting function implementation.

Crossrefs

Cf. A000040, A000312, A002110, A000142, A000079, A033844.

Formula

a(n) = A000040(A000312(n)).

Extensions

a(12)-a(14) from Hugo Pfoertner, Nov 28 2017