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 A054463 #19 Jan 07 2025 14:48:51
%S A054463 2,5,6,9,24,595
%N A054463 Numbers k such that (k+1)^k - k^(k-1) is prime.
%C A054463 a(7) > 3000, if it exists. - _Amiram Eldar_, Jun 28 2024
%C A054463 a(7) > 20000, if it exists. - _Michael S. Branicky_, Jan 07 2025
%t A054463 Select[Range[1000], PrimeQ[(# + 1)^# - #^(# - 1)] &] (* _Vincenzo Librandi_, Sep 27 2012 *)
%o A054463 (PARI) xp1toxp1(n)= { my(y); forstep(x=2,n,1, y=(x+1)^x - x^(x-1); if(ispseudoprime(y), print1(x, ", "))); }
%K A054463 nonn,more
%O A054463 1,1
%A A054463 _Cino Hilliard_, Aug 30 2003
%E A054463 a(6) from _Vincenzo Librandi_, Sep 27 2012