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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120357 a(n) is the smallest prime p such that 2^p-1 (a Mersenne number) contains 10^n or more decimal digits. 1
2, 31, 331, 3319, 33223, 332191, 3321937, 33219281, 332192831, 3321928097, 33219280951, 332192809589, 3321928094941, 33219280948907, 332192809488739, 3321928094887411, 33219280948873687, 332192809488736253 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

For n>0 almost all digits of a(n) from the left are equal to the first terms of the expansion Log[10]/Log[2] = {3, 3, 2, 1, 9, 2, 8, 0, 9, 4, 8, 8, 7, 3, 6, 2, 3, 4, 7, 8, 7, 0, 3, 1, 9, 4, 2, 9, 4, 8, 9, 3, 9, ...} = A020862(n). - Alexander Adamchuk, Jan 16 2007

LINKS

Farideh Firoozbakht, Table of n, a(n) for n = 0..29

G. L. Honaker, Jr. and Chris Caldwell, Prime Curios! 33219281

Author?, GIMPS [Broken link?]

EXAMPLE

E.g. a(7)=33219281 because 2^33219281-1 is the smallest Mersenne number that contains 10^7 (ten million) or more decimal digits.

CROSSREFS

Cf. A001348.

Cf. A020862 = decimal expansion of log(10)/log(2).

Sequence in context: A164676 A004307 A268879 * A152278 A156151 A231796

Adjacent sequences:  A120354 A120355 A120356 * A120358 A120359 A120360

KEYWORD

base,nonn

AUTHOR

G. L. Honaker, Jr., Jun 25 2006

EXTENSIONS

More terms from Farideh Firoozbakht, Jul 22 2006

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 14:52 EST 2018. Contains 317352 sequences. (Running on oeis4.)