Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.
A087664
Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.
Terms
- a(0) =0a(1) =2a(2) =1a(3) =4a(4) =0a(5) =5a(6) =2a(7) =9a(8) =0a(9) =1a(10) =1a(11) =1a(12) =0a(13) =3a(14) =3a(15) =2a(16) =0a(17) =4a(18) =1a(19) =2a(20) =0a(21) =6a(22) =2a(23) =7a(24) =0a(25) =1a(26) =1a(27) =1a(28) =0a(29) =5
External references
- oeis: A087664