Consider recurrence b(0) = (2n+1)/2, b(n) = b(n-1)*ceiling(b(n-1)); sequence gives first integer reached.
A081853
Consider recurrence b(0) = (2n+1)/2, b(n) = b(n-1)*ceiling(b(n-1)); sequence gives first integer reached.
Terms
- a(0) =3a(1) =60a(2) =14a(3) =268065a(4) =33a(5) =2093a(6) =60a(8) =95a(9) =13398a(10) =138a(11) =701600900a(12) =189a(13) =47415a(14) =248a(16) =315a(17) =123728a(18) =390a(19) =34427225343a(20) =473a(21) =268065a(22) =564a(24) =663a(25) =512298a(26) =770a(27) =467193780498a(28) =885a(29) =894443a(30) =1008
External references
- oeis: A081853