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 A074966 #34 Mar 11 2020 03:26:47
%S A074966 1,1,2,1,12,7,4,43,10,19,62,35,16,27,28,13,74,107,18,91,32,87,14,95,
%T A074966 96,43,68,135,120,19,58,7,58,63,54,31,42,115,10,157,110,13,4,403,122,
%U A074966 457,534,37,18,31,226,253,20,193,102,177,392,45,194,257,102,79,454,231,306
%N A074966 a(n) = least k such that n^n + k is prime.
%C A074966 "Are there any n except 1, 2 and 4 that make n^n + 1 a prime? He [Sierpiński] has shown that if such a prime exists it is greater than 10^30000." - Ogilvy and Anderson
%D A074966 C. Stanley Ogilvy and John T. Anderson, Excursions in Number Theory. Dover. New York: 1988. Page 82.
%H A074966 Hans Havermann and Seiichi Manyama, <a href="/A074966/b074966.txt">Table of n, a(n) for n = 1..2500</a> (Seiichi Manyama to 500)
%t A074966 Array[Block[{k = 1}, While[! PrimeQ[k + #], k++]; k] &[#^#] &, 65] (* _Michael De Vlieger_, Jul 06 2018 *)
%o A074966 (PARI) a(n)=(x->nextprime(x)-x)(n^n) \\ _Charles R Greathouse IV_, Nov 25 2014
%Y A074966 Cf. A055385, A074967.
%K A074966 nonn
%O A074966 1,3
%A A074966 _Zak Seidov_, Oct 03 2002
%E A074966 More terms from _Robert G. Wilson v_, Oct 04 2002
%E A074966 Name taken from Comments section by _Jon E. Schoenfield_, Jan 14 2015