Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).

A081852

Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).

Terms

    a(0) =1a(1) =4a(2) =20a(3) =2a(4) =7a(5) =8a(6) =3a(7) =26631380a(8) =55a(9) =4a(10) =416a(11) =112a(12) =5a(13) =32a(14) =34a(15) =6a(16) =285a(17) =13960a(18) =7a(19) =67358874a(20) =214544a(21) =8a(22) =75a(23) =78a(24) =9a(25) =62186796a(26) =7399041846a(27) =10a(28) =1178a(29) =173857344

External references