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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157034 Shorthand for A157033, the smallest prime with 2^n digits. 2
1, 9, 19, 37, 33, 121, 283, 37, 241, 3259, 2823, 67017, 13989, 9523 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The actual prime A157033(n) is obtained as 10^(2^n - 1) + a(n).

LINKS

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

MATHEMATICA

f[n_] := NextPrime[ 10^(2^n-1)] - 10^(2^n-1); Table[ f@n, {n, 0, 12}] (* Robert G. Wilson v, Mar 17 2009 *)

CROSSREFS

Cf. A157033.

Sequence in context: A051811 A034056 A195042 * A198590 A297396 A145958

Adjacent sequences:  A157031 A157032 A157033 * A157035 A157036 A157037

KEYWORD

more,nonn,base

AUTHOR

Lekraj Beedassy, Feb 22 2009

EXTENSIONS

a(8)-a(12) from Robert G. Wilson v, Mar 17 2009

a(13)-a(14) from Ray Chandler, Mar 22 2009

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 December 8 09:32 EST 2019. Contains 329862 sequences. (Running on oeis4.)