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 A272830 #17 May 02 2024 04:27:25 %S A272830 1,2,3,8,9,10,16,31,35,79,179,196,239,376,515,728,812,1154,2000,2379, %T A272830 2485,3523,3987,5221,5257,5739,17863,59127,106454,125894 %N A272830 Numbers k such that (8*10^k - 29)/3 is prime. %C A272830 For k > 1, numbers k such that the digit 2 followed by k-2 occurrences of the digit 6 followed by the digits 57 is prime (see Example section). %C A272830 a(31) > 2*10^5. %H A272830 Makoto Kamada, <a href="https://stdkmd.net/nrr">Factorization of near-repdigit-related numbers</a>. %H A272830 Makoto Kamada, <a href="https://stdkmd.net/nrr/prime/prime_difficulty.txt">Search for 26w57</a>. %e A272830 3 is in this sequence because (8*10^3 - 29)/3 = 2657 is prime. %e A272830 Initial terms and associated primes: %e A272830 a(1) = 1, 17; %e A272830 a(2) = 2, 257; %e A272830 a(3) = 3, 2657; %e A272830 a(4) = 8, 266666657; %e A272830 a(5) = 9, 2666666657, etc. %t A272830 Select[Range[0, 100000], PrimeQ[(8*10^# - 29)/3] &] %o A272830 (PARI) is(n)=ispseudoprime((8*10^n-29)/3) \\ _Charles R Greathouse IV_, Jun 13 2017 %Y A272830 Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269. %K A272830 nonn,more %O A272830 1,2 %A A272830 _Robert Price_, May 07 2016 %E A272830 a(29)-a(30) from _Robert Price_, Jul 03 2018