Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.
A083863
Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.
Terms
- a(0) =2a(1) =336a(2) =480480a(3) =3a(4) =10a(5) =11a(6) =4a(7) =86632a(8) =336a(9) =5a(10) =480480a(12) =6a(13) =38a(14) =40a(15) =7a(16) =2618a(17) =8089284a(18) =8a(19) =4400a(20) =4784a(21) =9a(22) =84a(23) =87a(24) =10a(27) =11
External references
- oeis: A083863