Least x>1 such that x^d == 1 (mod d) for each divisor d of n.

A076618

Least x>1 such that x^d == 1 (mod d) for each divisor d of n.

Terms

    a(0) =2a(1) =3a(2) =4a(3) =3a(4) =6a(5) =7a(6) =8a(7) =3a(8) =4a(9) =11a(10) =12a(11) =7a(12) =14a(13) =15a(14) =16a(15) =3a(16) =18a(17) =7a(18) =20a(19) =11a(20) =22a(21) =23a(22) =24a(23) =7a(24) =6a(25) =27a(26) =4a(27) =15a(28) =30a(29) =31

External references