|
%I #15 Sep 08 2022 08:46:10
%S 1,9,0,7,9,7,0,0,7,5,2,4,4,3,9,0,7,3,8,0,7,4,6,8,0,4,2,9,6,9,5,2,9,1,
%T 7,3,6,6,9,3,5,6,9,9,4,7,4,9,9,4,0,1,7,7,3,9,4,7,4,1,8,8,2,6,7,3,5,2,
%U 8,9,7,9,7,8,7,0,0,5,0,5,3,7,0,6,3,6,8,0,4,9,8,3,5,5,1,4,9,0,0,2,4,4,3,0,3
%N Decimal expansion of 2^4253 - 1, the 19th Mersenne prime A000668(19).
%C This prime and the 20th Mersenne prime were found in 1961 by Alexander Hurwitz, using IBM 7090.
%H Arkadiusz Wesolowski, <a href="/A248935/b248935.txt">Table of n, a(n) for n = 1281..2561</a>
%H Alexander Hurwitz, <a href="http://www.ams.org/journals/mcom/1962-16-078/S0025-5718-1962-0146162-X/S0025-5718-1962-0146162-X.pdf">New Mersenne Primes</a>, Mathematics of Computation, vol. 16, No. 78 (1962), pp. 249-251.
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Mersenne_prime">Mersenne prime</a>
%F Equals 2^A000043(19) - 1.
%e 19079700752443907380746804296952917366935699474994017739474188267352897...
%t Realdigits[2^4253 - 1, 10, 100][[1]] (* _G. C. Greubel_, Oct 03 2017 *)
%o (Magma) Reverse(Intseq(2^4253-1));
%o (PARI) eval(Vec(Str(2^4253-1)))
%Y Cf. A169684 = A000668(11), A169681 = A000668(12), A169685 = A000668(13), A204063 = A000668(14), A248931 = A000668(15), A248932 = A000668(16), A248933 = A000668(17), A248934 = A000668(18), A248936 = A000668(20).
%K nonn,cons,easy,fini,full
%O 1281,2
%A _Arkadiusz Wesolowski_, Oct 17 2014
|
