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