|
Search: id:A075107
|
|
|
| A075107 |
|
Number of steps to reach the first integer (=A075108(n)) starting with n/floor(log2(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached. |
|
+0 4
|
|
| 0, 0, 0, 2, 0, 1, 1, 0, 5, 2, 0, 3, 2, 0, 0, 3, 3, 2, 0, 2, 1, 3, 0, 2, 2, 2, 0, 1, 1, 1, 2, 5, 3, 0
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|