login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A204063
Decimal expansion of 2^607 - 1, the 14th Mersenne prime A000668(14).
19
5, 3, 1, 1, 3, 7, 9, 9, 2, 8, 1, 6, 7, 6, 7, 0, 9, 8, 6, 8, 9, 5, 8, 8, 2, 0, 6, 5, 5, 2, 4, 6, 8, 6, 2, 7, 3, 2, 9, 5, 9, 3, 1, 1, 7, 7, 2, 7, 0, 3, 1, 9, 2, 3, 1, 9, 9, 4, 4, 4, 1, 3, 8, 2, 0, 0, 4, 0, 3, 5, 5, 9, 8, 6, 0, 8, 5, 2, 2, 4, 2, 7, 3, 9, 1, 6, 2, 5, 0, 2, 2, 6, 5, 2, 2, 9, 2, 8, 5, 6, 6, 8, 8, 8, 9
OFFSET
183,1
LINKS
D. H. Lehmer, Recent Discoveries of Large Primes, Mathematics of Computation, vol. 6, No. 37 (1952), p. 61.
Wikipedia, Mersenne prime
FORMULA
2^A000043(14)-1.
EXAMPLE
2^607-1 = 531 * 10^180 +
137992816767098689588206552468627329593117727031923199444138 * 10^120 +
200403559860852242739162502265229285668889329486246501015346 * 10^60 +
579337652707239409519978766587351943831270835393219031728127.
MATHEMATICA
RealDigits[2^607-1, 10, 120][[1]] (* Harvey P. Dale, Sep 23 2016 *)
PROG
(Magma) Reverse(Intseq(2^607-1)); // Arkadiusz Wesolowski, Oct 18 2014
(PARI) digits(2^607-1) \\ Simplified by M. F. Hasler, Oct 19 2019
CROSSREFS
Cf. A169684 = A000668(11), A169681 = A000668(12), A169685 = A000668(13), A248931 = A000668(15), A248932 = A000668(16), A248933 = A000668(17), A248934 = A000668(18), A248935 = A000668(19), A248936 = A000668(20).
Sequence in context: A094853 A096937 A097527 * A132400 A232810 A063268
KEYWORD
nonn,cons,easy,fini,full
AUTHOR
M. F. Hasler, Jan 09 2013
STATUS
approved