cp's OEIS Frontend

A089065 Decimal expansion of 2^13466917 - 1, the 39th Mersenne prime A000668(39).

%I A089065 #21 Apr 05 2024 16:54:14
%S A089065 9,2,4,9,4,7,7,3,8,0,0,6,7,0,1,3,2,2,2,4,7,7,5,8,3,8,2,5,4,7,6,6,4,0,
%T A089065 5,1,9,2,5,3,5,4,4,0,1,0,7,9,9,5,8,2,9,9,0,2,1,0,3,0,9,3,6,0,8,0,2,9,
%U A089065 5,6,5,6,5,8,0,5,5,9,6,1,0,0,4,7,6,1,3,1,2,1,5,5,5,7,3,0,5,8,4,6,4,9,0,2,4
%N A089065 Decimal expansion of 2^13466917 - 1, the 39th Mersenne prime A000668(39).
%C A089065 Since 2^13466917 ends in ...6259072, this sequence ends in ...6,2,5,9,0,7,1
%H A089065 Muniru A Asiru, <a href="/A089065/b089065.txt">Table of n, a(n) for n = 4053946..4055946</a>
%H A089065 Peter Alfeld, <a href="http://www.math.utah.edu/~alfeld/math/largeprime.html">Largest Known Prime</a>.
%H A089065 OEIS Wiki, <a href="/wiki/Mersenne_primes">Mersenne primes</a> (with a list of similar sequences)
%p A089065 evalf[120](2^(13466917)-1); # _Muniru A Asiru_, Mar 20 2019
%t A089065 IntegerDigits[2^13466917 - 1][[;;100]] (* _Paolo Xausa_, Apr 05 2024 *)
%o A089065 (PARI) digitsm39(n) = { default(realprecision,n); p10 = frac(m*log(2)/log(10)); b = 10^p10/10; for(j=1,n, v=b*10; d=floor(v); b=v-d; print1(d",") ) }
%Y A089065 Cf. A000043, A000668.
%K A089065 fini,cons,nonn
%O A089065 4053946,1
%A A089065 _Cino Hilliard_, Dec 20 2003
%E A089065 Edited by _Georg Fischer_, Mar 19 2019