|
%I #13 Apr 03 2023 10:36:11
%S 2,31,331,3319,33223,332191,3321937,33219281,332192831,3321928097,
%T 33219280951,332192809589,3321928094941,33219280948907,
%U 332192809488739,3321928094887411,33219280948873687,332192809488736253
%N a(n) is the smallest prime p such that 2^p-1 (a Mersenne number) contains 10^n or more decimal digits.
%C 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
%H Farideh Firoozbakht, <a href="/A120357/b120357.txt">Table of n, a(n) for n = 0..29</a>
%H G. L. Honaker, Jr. and Chris Caldwell, <a href="https://t5k.org/curios/cpage/13130.html">Prime Curios! 33219281</a>
%H Author?, <a href="http://www.mersenne.org/prize.htm">GIMPS</a> [Broken link?]
%e E.g. a(7)=33219281 because 2^33219281-1 is the smallest Mersenne number that contains 10^7 (ten million) or more decimal digits.
%Y Cf. A001348.
%Y Cf. A020862 = decimal expansion of log(10)/log(2).
%K base,nonn
%O 0,1
%A _G. L. Honaker, Jr._, Jun 25 2006
%E More terms from _Farideh Firoozbakht_, Jul 22 2006
|
