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 A107465 #14 Sep 22 2024 02:06:44 %S A107465 3,32,96,104,603,870,1609,2505,4889,5024,5345,14955 %N A107465 Numbers k such that 10^k*(66161819199+10^(k+10)) + 1 is prime. %C A107465 These are non-palindromic strobogrammatic primes and they have all been certified. No more terms up to 8700. Primality proof for the largest (a "gigantic" prime): PFGW Version 20041001.Win_Stable (v1.2 RC1b) [FFT v23.8] Primality testing 10^5345*(66161819199+10^(5345+10))+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 34.91% 10^5345*(66161819199+10^(5345+10))+1 is prime! (15.1367s+0.0109s) %H A107465 R. Ondrejka, <a href="http://www.utm.edu/research/primes/lists/top_ten/">The Top Ten: a Catalogue of Primal Configurations</a>. %o A107465 (PARI) is(n)=ispseudoprime(10^n*(66161819199+10^(n+10))+1) \\ _Charles R Greathouse IV_, Jun 13 2017 %Y A107465 Cf. A007597. %K A107465 base,nonn,more %O A107465 1,1 %A A107465 _Jason Earls_, May 27 2005 %E A107465 a(12) from _Michael S. Branicky_, Sep 21 2024