|
Search: id:A143812
|
|
|
| A143812 |
|
Maximal number of halving and tripling steps to reach 1 in '3x+1' problem for range (1, ... , n). |
|
+0
1
|
|
| 1, 2, 8, 8, 8, 9, 17, 17, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 24, 24, 112, 122
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
