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 A108879 #18 Sep 08 2022 08:45:19 %S A108879 2,4,20,93,100,1536,2835 %N A108879 Numbers n such that (n-1)*n^n+1 is prime. %e A108879 2 is in the sequence because (2-1)*2^2+1 = 1*2^2+1 = 4+1 = 5, which is prime. %t A108879 Select[Range[1000], PrimeQ[(# - 1) #^# + 1] &] (* _Vincenzo Librandi_, Oct 23 2014 *) %o A108879 (PARI) isok(n) = isprime((n-1)*n^n+1); \\ _Michel Marcus_, Oct 23 2014 %o A108879 (Magma) [n: n in [1..1000] |IsPrime((n-1)*n^n+1)]; // _Vincenzo Librandi_, Oct 23 2014 %o A108879 (Python) %o A108879 from sympy import isprime %o A108879 def afind(limit, startk=0): %o A108879 for k in range(startk, limit+1): %o A108879 if isprime((k-1)*k**k + 1): %o A108879 print(k, end=", ") %o A108879 afind(200) # _Michael S. Branicky_, Jan 01 2022 %Y A108879 Cf. A108318. %K A108879 hard,more,nonn %O A108879 1,1 %A A108879 _Ray G. Opao_, Jul 14 2005 %E A108879 a(7) from _Michael S. Branicky_, Jan 01 2022