|
| |
|
|
A060415
|
|
In the `3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.
|
|
4
| |
|
|
0, 2, 3, 45, 48, 20, 78, 124, 95, 103, 62, 147, 186, 36, 168, 65, 60, 179, 41, 146, 254, 254, 319, 346, 423, 166, 297, 206, 223, 164, 659, 607, 840, 808, 512
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
