Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.

A007755

Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =5a(4) =11a(5) =17a(6) =41a(7) =83a(8) =137a(9) =257a(10) =641a(11) =1097a(12) =2329a(13) =4369a(14) =10537a(15) =17477a(16) =35209a(17) =65537a(18) =140417a(19) =281929a(20) =557057a(21) =1114129a(22) =2384897a(23) =4227137a(24) =8978569a(25) =16843009a(26) =35946497a(27) =71304257a(28) =143163649a(29) =286331153

External references