Non-cyclic numbers n such that phi(n)^phi(n) == gcd(n, phi(n)) (mod n), where phi is Euler totient function.
A230919
Non-cyclic numbers n such that phi(n)^phi(n) == gcd(n, phi(n)) (mod n), where phi is Euler totient function.
Terms
- a(0) =12a(1) =48a(2) =56a(3) =80a(4) =192a(5) =240a(6) =252a(7) =351a(8) =448a(9) =768a(10) =992a(11) =1100a(12) =1134a(13) =1260a(14) =1280a(15) =1824a(16) =1872a(17) =2016a(18) =3072a(19) =3300a(20) =3520a(21) =3584a(22) =3840a(23) =3875a(24) =4352a(25) =5103a(26) =6156a(27) =9072a(28) =9120a(29) =9288
External references
- oeis: A230919