Numbers m>0 such that the number of solutions to x^m==1 (mod m), 1<=x<=m, is not equal to gcd(m, phi(m)).
A072989
Numbers m>0 such that the number of solutions to x^m==1 (mod m), 1<=x<=m, is not equal to gcd(m, phi(m)).
Terms
- a(0) =20a(1) =30a(2) =40a(3) =42a(4) =52a(5) =60a(6) =66a(7) =68a(8) =70a(9) =78a(10) =80a(11) =84a(12) =90a(13) =100a(14) =102a(15) =104a(16) =110a(17) =114a(18) =116a(19) =120a(20) =126a(21) =130a(22) =132a(23) =136a(24) =138a(25) =140a(26) =148a(27) =150a(28) =154a(29) =156
External references
- oeis: A072989