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 A100501 #35 Aug 30 2024 21:13:54
%S A100501 1,2,5,8,24,29,84,110,129,176,593,1137,2675,4992,26904,31572,55077,
%T A100501 81021,122274
%N A100501 Numbers n such that 3*10^n+7 is prime.
%C A100501 593 and 1137 both give primes. - Joao da Silva (zxawyh66(AT)yahoo.com), Sep 30 2005
%C A100501 a(19) > 10^5. - _Robert Price_, Jan 26 2015
%C A100501 a(20) > 2*10^5. - _Robert Price_, Jul 04 2015
%C A100501 Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - _Hugo Pfoertner_, Nov 14 2019
%H A100501 Makoto Kamada, <a href="https://stdkmd.net/nrr/3/30007.htm#prime">Prime numbers of the form 300...007</a>.
%H A100501 Sabin Tabirca and Kieran Reynolds, <a href="http://multimedia.ucc.ie/Staff/ST/articles/SNJ03_Tabirca1.ps">Lacunary Prime Numbers</a>.
%F A100501 a(n) = A101824(n) + 1.
%e A100501 (3*10^5)+7 = (3*100000)+7 = 300000+7 = 300007, which is prime.
%t A100501 Do[ If[ PrimeQ[ 3*10^n + 7], Print[ n ]], {n, 0, 20000}]
%o A100501 (PARI) is(n)=ispseudoprime(3*10^n+7) \\ _Charles R Greathouse IV_, May 22 2017
%Y A100501 Cf. A096774, A101824.
%K A100501 nonn,more,hard
%O A100501 1,2
%A A100501 Julien Peter Benney (jpbenney(AT)ftml.net), Nov 23 2004
%E A100501 a(12) from Mark Hudson (mrmarkhudson(AT)hotmail.com), Nov 26 2004
%E A100501 a(13)-a(14) from _Hugo Pfoertner_, Nov 29 2004. The next term is > 20000.
%E A100501 a(15) from Kamada data by _Robert Price_, Dec 12 2010
%E A100501 a(16)-a(18) from Kamada data by _Robert Price_, Jan 26 2015
%E A100501 a(19) from _Robert Price_, Jul 04 2015