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 A258043 #18 May 23 2015 06:43:33 %S A258043 3,1,8,2,2,2,4,4,2,16,193,4,8,3,4,21,11,18,8,8,11,2,8,7,70,3,95,4,172, %T A258043 7,4,94,143,90,193,17,2,8,46,41,2,10,254,90,74,75,371,85,70,3,177,53, %U A258043 85,91,18,24,84,103,34,95,34,111,80,253,84,224,397,1002,11,33,773,29,647,20 %N A258043 Smallest k such that prime(k)^n - 2 is prime. %C A258043 Primes of the form prime(n)^n - 2: 3, 7, 61, 67, 71, 73, 127, ... %e A258043 a(1) = 3 because prime(3)^1 - 2 = 3 and 3 is prime, %e A258043 a(2) = 1 because prime(1)^2 - 2 = 2 and 2 is prime, %e A258043 a(3) = 8 because prime(8)^3 - 2 = 6857 and 6857 is prime. %o A258043 (PARI) a(n) = my(k = 1); while(! isprime(prime(k)^n-2), k++); k; \\ _Michel Marcus_, May 23 2015 %Y A258043 Cf. A014224, A014232, A109080, A204578. %K A258043 nonn %O A258043 1,1 %A A258043 _Juri-Stepan Gerasimov_, May 22 2015