The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A033844 a(n) = prime(2^n). 46
 2, 3, 7, 19, 53, 131, 311, 719, 1619, 3671, 8161, 17863, 38873, 84017, 180503, 386093, 821641, 1742537, 3681131, 7754077, 16290047, 34136029, 71378569, 148948139, 310248241, 645155197, 1339484197, 2777105129, 5750079047, 11891268401, 24563311309, 50685770167, 104484802057, 215187847711 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(n) is the smallest number m such that pi(m)=d(m)^n, where d(m) is number of positive divisors of m (the proof is easy). - Farideh Firoozbakht, Jun 06 2005 LINKS David Baugh, Table of n, a(n) for n = 0..78 (terms n = 0..57 from Charles R Greathouse IV, terms n = 58..78 found using Kim Walisch's primecount program). MATHEMATICA Table[Prime[2^n], {n, 0, 32}] PROG (PARI) a(n)=prime(2^n) \\ Charles R Greathouse IV, Nov 02 2014 CROSSREFS Cf. A000040, A018249, A051438, A051440, A051439, A006988, A107655. Sequence in context: A246033 A122724 A256758 * A037028 A052919 A005807 Adjacent sequences:  A033841 A033842 A033843 * A033845 A033846 A033847 KEYWORD nonn,hard AUTHOR Vasiliy Danilov (danilovv(AT)usa.net), Jun 15 1998 EXTENSIONS More terms from Robert G. Wilson v, Jun 09 2000 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.

Last modified October 27 01:02 EDT 2020. Contains 338035 sequences. (Running on oeis4.)