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 A327661 #5 Sep 21 2019 14:41:58 %S A327661 3,2,2,3,8,19,18,7,10,11,252,43,563528,98,14,167,18,28,410,44,200,140, %T A327661 29028,124,68,79,2420,47,26850,63,2454,140,42,164,38,62,740,67,448,51, %U A327661 84,135,404882,43,84,140,140,115,710,2390,46640,261,60,72,2064,414 %N A327661 Least number k > n - 2 such that k*n^k - 1 is prime. %C A327661 Different version of A240235. Some authors, like Caldwell (link), require that k + 2 > n before they use the term generalized Woodall for a prime of form k*n^k - 1. %H A327661 Jeppe Stig Nielsen, <a href="/A327661/b327661.txt">Table of n, a(n) for n = 1..144</a> %H A327661 Chris K. Caldwell, <a href="https://primes.utm.edu/top20/page.php?id=45">The Top Twenty: Generalized Woodall</a>. %e A327661 To find a(11), consider numbers k*11^k - 1 where k > 9. The first time it is prime, is for k = 252, so a(11) = 252. %o A327661 (PARI) for(b=1,+oo,for(k=b-1,+oo,if(ispseudoprime(k*b^k-1),print1(k,", ");next(2)))) %Y A327661 Cf. A240235, A327660, A240234. %K A327661 nonn,hard %O A327661 1,1 %A A327661 _Jeppe Stig Nielsen_, Sep 21 2019