OFFSET
1,1
COMMENTS
By Dirichlet's theorem on primes in arithmetic progressions, such a k always exists. - Robert Israel, Mar 04 2026
LINKS
Robert Israel, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = A053989(n^n). - Robert Israel, Mar 04 2026
MAPLE
f:= proc(n) local r, k;
r:= n^n;
for k from 1 do if isprime(k*r-1) then return k fi od
end proc:
map(f, [$1..100]); # Robert Israel, Mar 04 2026
MATHEMATICA
Table[k = 1; While[! PrimeQ[k*n^n - 1], k++]; k, {n, 65}] (* T. D. Noe, Nov 15 2013 *)
CROSSREFS
Cf. A035092 (least k such that k*(n^2)+1 is a prime).
Cf. A175763 (least k such that k*(n^n)+1 is a prime).
Cf. A035093 (least k such that k*n!+1 is a prime).
Cf. A193807 (least k such that n*(k^2)+1 is a prime).
Cf. A231119 (least k such that n*(k^k)+1 is a prime).
Cf. A057217 (least k such that n*k!+1 is a prime).
Cf. A034693 (least k such that n*k +1 is a prime).
Cf. A231819 (least k such that k*(n^2)-1 is a prime).
Cf. A083663 (least k such that k*n!-1 is a prime).
Cf. A231734 (least k such that n*(k^2)-1 is a prime).
Cf. A231735 (least k such that n*(k^k)-1 is a prime).
Cf. A231820 (least k such that n*k!-1 is a prime).
Cf. A053989 (least k such that n*k -1 is a prime).
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Nov 13 2013
STATUS
approved
