|
Search: id:A087670
|
|
|
| A087670 |
|
Consider recurrence b(0) = (2n+1)/n, b(n) = b(n-1)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached. |
|
+0
2
|
|
| 3, 5, 336, 18, 8003163168, 86632, 7191948600, 17, 72960
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
