login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062448 Prime numbers at large subscripts: a(n) = prime(n^n). 0
2, 2, 7, 103, 1619, 28687, 567871, 12579617, 310248241, 8448283757, 252097800623, 8187297276401, 287629183566841, 10871811891162227, 440023773804299591 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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

LINKS

Table of n, a(n) for n=0..14.

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

FORMULA

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

EXAMPLE

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

CROSSREFS

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

Sequence in context: A317808 A326909 A246053 * A248237 A139523 A079242

Adjacent sequences:  A062445 A062446 A062447 * A062449 A062450 A062451

KEYWORD

hard,nonn

AUTHOR

Labos Elemer, Jul 09 2001

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 22 00:43 EDT 2019. Contains 326169 sequences. (Running on oeis4.)