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 A175763 #12 Jun 15 2021 01:28:41
%S A175763 1,1,4,1,12,3,4,10,10,3,86,2,40,31,28,12,8,2,34,19,28,19,116,75,4,15,
%T A175763 110,7,8,79,42,36,14,112,80,11,30,67,78,226,170,108,96,205,272,18,54,
%U A175763 98,42,15,78,63,362,115,292,40,170,60,350,16,366,108,234,448,128,63,42,72
%N A175763 Least k such that k*n^n + 1 is prime.
%C A175763 By Linnik's theorem, a(n) = O(n^(L*n)) for some effectively computable L.
%H A175763 Charles R Greathouse IV, <a href="/A175763/b175763.txt">Table of n, a(n) for n = 1..1000</a>
%t A175763 lk[n_]:=Module[{c=n^n,k=1},While[!PrimeQ[k*c+1],k++];k]; Array[lk,70] (* _Harvey P. Dale_, Apr 10 2019 *)
%o A175763 (PARI) a(n)=my(N=n^n,k=1);while(!isprime(k*n^n+1),k++);k
%Y A175763 Cf. A070855.
%K A175763 nonn
%O A175763 1,3
%A A175763 _Charles R Greathouse IV_, Aug 31 2010