Smallest k>1 such that for each integer x, x^k=x or x^k=0 (mod n); or 0 if no such k exists.
A066858
Smallest k>1 such that for each integer x, x^k=x or x^k=0 (mod n); or 0 if no such k exists.
Terms
- a(0) =2a(1) =3a(2) =3a(3) =5a(4) =3a(5) =7a(6) =3a(7) =7a(8) =5a(9) =11a(10) =0a(11) =13a(12) =7a(13) =5a(14) =5a(15) =17a(16) =0a(17) =19a(18) =0a(19) =7a(20) =11a(21) =23a(22) =0a(23) =21a(24) =13a(25) =19a(26) =0a(27) =29a(28) =5a(29) =31
External references
- oeis: A066858