Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.
A098197
Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =4a(4) =6a(5) =10a(6) =18a(7) =30a(8) =42a(9) =78a(10) =114a(11) =186a(12) =294a(13) =390a(14) =582a(15) =798a(16) =1194a(17) =1950a(18) =2922a(19) =4074a(20) =5586a(21) =7770a(22) =11154a(23) =15810a(24) =22110a(25) =30702a(26) =42570a(27) =53130a(28) =68970a(29) =105090
External references
- oeis: A098197