Smallest m such that the number of iterations of "take odd part of phi" to reach 1 from m (A227944) is n.

A227946

Smallest m such that the number of iterations of "take odd part of phi" to reach 1 from m (A227944) is n.

Terms

    a(0) =1a(1) =2a(2) =7a(3) =19a(4) =47a(5) =163a(6) =487a(7) =1307a(8) =2879a(9) =19683a(10) =39367a(11) =177147a(12) =531441a(13) =1594323a(14) =4782969a(15) =14348907a(16) =43046721a(17) =86093443a(18) =258280327a(19) =688747547a(20) =3486784401a(21) =10460353203

External references