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

A087677

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

Terms

    a(0) =2a(1) =21a(2) =240a(3) =3a(4) =10a(5) =11a(6) =4a(7) =170195636a(8) =84a(9) =5a(10) =736a(11) =922709a(12) =6a(13) =38a(14) =40a(15) =7a(16) =374a(17) =10751097a(18) =8a(19) =550a(20) =598a(21) =9a(22) =84a(23) =87a(24) =10a(25) =1173908a(26) =1371360a(27) =11a(28) =262696240a(29) =203210

External references