This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A267875 #18 Apr 05 2024 20:09:49 %S A267875 3,0,0,3,7,6,4,1,8,0,8,4,6,0,6,1,8,2,0,5,2,9,8,6,0,9,8,3,5,9,1,6,6,0, %T A267875 5,0,0,5,6,8,7,5,8,6,3,0,3,0,3,0,1,4,8,4,8,4,3,9,4,1,6,9,3,3,4,5,5,4, %U A267875 7,7,2,3,2,1,9,0,6,7,9,9,4,2,9,6,8,9,3 %N A267875 Decimal expansion of Mersenne prime 2^74207281 - 1. %C A267875 As of January 7, 2016, 2^74207281 - 1 is the largest known prime number and the 49th known Mersenne prime. %H A267875 C. Caldwell, <a href="https://t5k.org/notes/74207281.htm">GIMPS Project Discovers Largest Known Prime Number: 2^74,207,281-1</a> %H A267875 C. Caldwell, <a href="https://primes.utm.edu/primes/page.php?id=120909">2^74207281 - 1</a> %t A267875 IntegerDigits[2^74207281 - 1][[;;100]] (* _Paolo Xausa_, Apr 05 2024 *) %o A267875 (PARI) /* adapted from Hasler's PARI program in A193864 */ %o A267875 list(Nmax) = {default(realprecision, Nmax+5); digits(10^frac(74207281*log(2)/log(10))\.1^Nmax)} %o A267875 list(50) \\ print initial 50 digits %o A267875 (Python) %o A267875 from gmpy2 import mpz %o A267875 def A267875(n): return int((mpz(2)**74207281-1)//mpz(10)**(44677235-n) % 10) # _Chai Wah Wu_, Jun 07 2021 %Y A267875 Cf. A000043, A000668, A089065, A089578, A117853, A193864. %K A267875 nonn,cons,fini %O A267875 22338618,1 %A A267875 _Felix Fröhlich_, Jan 21 2016