A236385 Largest number m such that repeated application of A235600 takes n steps to reach 1, where A235600(k) = k/A007953(k) if the digital sum A007953(k) divides k, A235600(k) = k otherwise.
1, 9, 84, 1458, 39366, 1062882, 47829690, 1721868840, 92980917360, 5020969537440, 361509806695680, 26028706082088960, 1874066837910405120, 58110713122393733760, 3643185932897827553280, 393464080752965375754240
Offset: 0
Links
- Ray Chandler, Table of n, a(n) for n = 0..322 [terms <= 1000 digits]
- Ray Chandler, Table of n, a(n) for n = 0..440 [complete sequence]