Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.

A087676

Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.

Terms

    a(0) =0a(1) =3a(2) =5a(3) =0a(4) =1a(5) =1a(6) =0a(7) =12a(8) =2a(9) =0a(10) =3a(11) =7a(12) =0a(13) =1a(14) =1a(15) =0a(16) =2a(17) =7a(18) =0a(19) =2a(20) =2a(21) =0a(22) =1a(23) =1a(24) =0a(25) =5a(26) =5a(27) =0a(28) =7a(29) =4

External references