Least x>1 such that x^d == 1 (mod d) for each divisor d of n, for all nonsquarefree numbers n (cf. A013929).
A076619
Least x>1 such that x^d == 1 (mod d) for each divisor d of n, for all nonsquarefree numbers n (cf. A013929).
Terms
- a(0) =3a(1) =3a(2) =4a(3) =7a(4) =3a(5) =7a(6) =11a(7) =7a(8) =6a(9) =4a(10) =15a(11) =3a(12) =7a(13) =11a(14) =23a(15) =16a(16) =7a(17) =8a(18) =11a(19) =27a(20) =7a(21) =15a(22) =31a(23) =22a(24) =3a(25) =35a(26) =7a(27) =16a(28) =39a(29) =11
External references
- oeis: A076619