OFFSET
1,2
COMMENTS
a(p) = p when p is prime. It appears that a(n) stabilizes for the subsequences n = k^m for each fixed k > 1 at large enough m.
a(n) = n if there are more than n/2 distinct integers x^n mod n. - David A. Corneth, Oct 16 2023
LINKS
David A. Corneth, PARI program
PROG
(PARI) { a(n) = my(S, t); S=Set(); for(x=0, n-1, for(y=x, n-1, t=lift(Mod(x, n)^n+Mod(y, n)^n); S=setunion(S, [t]); ); ); #S }
(PARI) a(n) = #setbinop((x, y)->Mod(x, n)^n+Mod(y, n)^n, [0..n-1]); \\ Michel Marcus, Oct 12 2023
(PARI) See PARI link \\ David A. Corneth, Oct 16 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Albert Mukovskiy, Oct 11 2023
STATUS
approved