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 A224471 #30 Dec 22 2024 10:07:28
%S A224471 1,3,37,45,597,1131,14203,112539
%N A224471 Numbers k such that 8^k - k is prime.
%C A224471 a(8) > 41000. - _Giovanni Resta_, Apr 07 2013
%C A224471 a(9) > 2*10^5. - _Robert Price_, Jan 19 2014
%o A224471 (Java)
%o A224471 import java.math.BigInteger;
%o A224471 public class A224471 {
%o A224471 public static void main (String[] args) {
%o A224471 BigInteger b8 = BigInteger.valueOf(8);
%o A224471 BigInteger m = BigInteger.valueOf(64);
%o A224471 for(long n=1; ; n+=2) {
%o A224471 BigInteger b = b8.subtract(BigInteger.valueOf(n));
%o A224471 if (b.isProbablePrime(2)) {
%o A224471 if (b.isProbablePrime(80))
%o A224471 System.out.printf("%d\n", n);
%o A224471 }
%o A224471 b8 = b8.multiply(m);
%o A224471 }
%o A224471 }
%o A224471 }
%o A224471 (PARI) forstep(n=1,10^4,2,if(ispseudoprime(8^n-n),print1(n,", "))); /* _Joerg Arndt_, Apr 07 2013 */
%Y A224471 Cf. A048744, A058037, A057908, A058046, A058829, A224470, A224469, A224469.
%K A224471 nonn,hard,more
%O A224471 1,2
%A A224471 _Alex Ratushnyak_, Apr 06 2013
%E A224471 a(7) from _Giovanni Resta_, Apr 07 2013
%E A224471 a(8) from _Robert Price_, Jan 19 2014