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 A256228 #25 May 31 2024 22:11:43 %S A256228 1,2,4,5,7,9,10,17,21,41,51,59,61,77,79,83,97,108,427,615,869,900,966, %T A256228 3150,3239,3932,5218,11941,30558,44697,90334,113874,128343,142810, %U A256228 222253 %N A256228 Numbers k such that 4*10^k - 21 is prime. %C A256228 For k > 1, numbers that begin with the digit 3 followed by k-2 occurrences of the digit 9 followed by the digits 79 are prime (see Example section). %C A256228 a(36) > 3*10^5. %H A256228 Makoto Kamada, <a href="https://stdkmd.net/nrr">Factorization of near-repdigit-related numbers</a>. %H A256228 Makoto Kamada, <a href="https://stdkmd.net/nrr/prime/prime_difficulty.txt">Search for 39w79</a>. %e A256228 4 is in this sequence because 4*10^4 - 21 = 39979, which is prime. %e A256228 Initial terms and associated primes: %e A256228 a(1) = 1, 19; %e A256228 a(2) = 2, 379; %e A256228 a(3) = 4, 39979; %e A256228 a(4) = 5, 399979; %e A256228 a(5) = 7, 39999979, etc. %t A256228 Select[Range[1, 100000], PrimeQ[4*10^# - 21] &] %o A256228 (PARI) is(n)=ispseudoprime(4*10^n - 21) \\ _Charles R Greathouse IV_, Jun 13 2017 %Y A256228 Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269. %K A256228 nonn,more %O A256228 1,2 %A A256228 _Robert Price_, Apr 17 2016 %E A256228 a(32)-a(34) from _Robert Price_, Sep 10 2018 %E A256228 a(35) from _Robert Price_, Jun 01 2023