%I #4 Jul 09 2017 14:56:01
%S 3,2,2,2,2,2,3,2,2,2,2,4,2,3,2,2,3,5,2,2,2,3,3,2,4,2,5,2,5,2,2,7,5,3,
%T 2,9,3,2,2,3,2,31,4,2,2,2,3,2,4,2,108,4,2,2,2,2,3,3,2,2,18,7,3,2,2,2,
%U 4,2,3,2,5,32,108,5,3,2,11,4,15,3,4,19,2,6,2,2,11,107,2,42,4,39,2,2,6,2,3
%N Least number x such that n^x-n-1 is prime.
%C Least number x such that x^n-x-1 is prime see A127599.
%t a = {}; Do[k = 2; While[ ! PrimeQ[n^k - n - 1], k++ ]; AppendTo[a, k], {n, 2, 500}]; a (*Artur Jasinski*)
%t lnx[n_]:=Module[{x=1},While[!PrimeQ[n^x-n-1],x++];x]; Array[lnx,100,2] (* _Harvey P. Dale_, Jul 09 2017 *)
%Y Cf. A127599
%K nonn
%O 2,1
%A _Artur Jasinski_, May 24 2010