|
Search: id:A074348
|
|
|
| A074348 |
|
Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-Lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and Lpf(n) is the largest prime factor of n. |
|
+0
1
|
|
| 1, 8, 24, 45, 75, 160, 273, 429, 741, 1001, 1183, 1547, 2645, 3553, 4301, 5423, 10880, 23465, 33371, 39109, 49075, 74011, 98933, 104371, 107911, 163489
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
