OFFSET
2,1
COMMENTS
a(n) is a perfect power, and a(n) == 1 + n*A338136(n) (mod n^2).
LINKS
Jinyuan Wang, Table of n, a(n) for n = 2..1000
EXAMPLE
MAPLE
g:= proc(n) local k, x, j, F;
for k from 2 to n-2 do
x:= (n+1)^k;
for j from 2 to floor(k*log[n](n+1)) do
F:= ifactors(x mod (n^j))[2];
if igcd(op(map(t -> t[2], F))) > 1 then return x mod (n^j) fi
od od
end proc:
g(2):= 9: g(3):= 4:
map(g, [$2..40]);
CROSSREFS
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Oct 12 2020
STATUS
approved