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!)
 A051439 a(n) = prime(2^n + 1). 10
 3, 5, 11, 23, 59, 137, 313, 727, 1621, 3673, 8167, 17881, 38891, 84047, 180511, 386117, 821647, 1742539, 3681149, 7754081, 16290073, 34136059, 71378603, 148948141, 310248251, 645155227, 1339484207, 2777105131, 5750079077 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Hugo Pfoertner, Table of n, a(n) for n = 0..57 Kim Walisch, Fast C++ prime counting function implementation. EXAMPLE a(0) = prime(2^0+1) = prime(2) = 3, a(1) = prime(2+1) = prime(3) = 5, a(2) = prime(2^2+1) = prime(5) = 11, a(3) = prime(2^3+1) = prime(9) = 23, and so on. - N. J. A. Sloane, Dec 09 2020 MATHEMATICA Prime[2^Range[0, 30]+1] (* Harvey P. Dale, Jan 19 2014 *) CROSSREFS Cf. A000040, A033844, A018249, A051438, A051440. Sequence in context: A139376 A074892 A074874 * A214873 A330951 A018116 Adjacent sequences:  A051436 A051437 A051438 * A051440 A051441 A051442 KEYWORD nonn AUTHOR EXTENSIONS More terms from Michael Lugo (mlugo(AT)thelabelguy.com), Dec 22 1999 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 November 28 13:47 EST 2021. Contains 349413 sequences. (Running on oeis4.)