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