Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.
A063444
Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.
Terms
- a(0) =3a(1) =12a(2) =13a(3) =15a(4) =121a(5) =35a(6) =86a(7) =64a(8) =37a(9) =99a(10) =726a(11) =72a(12) =158a(13) =196a(14) =61a(15) =96a(16) =4931a(17) =73a(18) =7639a(19) =175a(20) =343a(21) =267a(22) =2302a(23) =104a(24) =250a(25) =676a(26) =162a(27) =637a(28) =3481a(29) =154
External references
- oeis: A063444