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 A187025 #15 May 17 2024 03:19:28
%S A187025 1,4,1,2,1,4,2,2,1,1436,1,4,501969,4,1,644,1,5784852794328402307380,2,
%T A187025 2,1,20,3,4,36,4,1,2,1,18353950678197027912484562396837972855962080,8,
%U A187025 2,3,8,1,4,5,4,1,2,1,4,2,4,1,36,2,4,3,128,1,2,5,85840,2,4,1,12,1,16,273
%N A187025 a(n) is the least number k such that k*n+1 is a prime dividing n^n-1.
%C A187025 The smallest prime factor of n^n-1 of the form k*n+1 is A187023(n).
%H A187025 Amiram Eldar, <a href="/A187025/b187025.txt">Table of n, a(n) for n = 2..138</a>
%e A187025 7^7-1 = 2*3*29*4733; the smallest prime divisor of the form k*n+1 is 29 = 4*7+1, hence a(7) = 4.
%t A187025 Table[p=First/@FactorInteger[n^n-1]; (Select[p, Mod[#1, n] == 1 &, 1][[1]] - 1)/n, {n, 2, 40}]
%o A187025 (Magma) A187025:=function(n); for d in PrimeDivisors(n^n-1) do if d mod n eq 1 then return (d-1)/n; end if; end for; return 0; end function; [ A187025(n): n in [2..50] ]; // _Klaus Brockhaus_, Mar 02 2011
%Y A187025 Cf. A187023, A187024.
%K A187025 nonn
%O A187025 2,2
%A A187025 _Michel Lagneau_, Mar 02 2011