A236385 - cp's OEIS frontend

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.

n	a(n)
0	1
1	9
2	84
3	1458
4	39366
5	1062882
6	47829690
7	1721868840
8	92980917360
9	5020969537440
10	361509806695680
11	26028706082088960
12	1874066837910405120
13	58110713122393733760
14	3643185932897827553280
15	393464080752965375754240

[1, 9, 84, 1458, 39366, 1062882, 47829690, 1721868840, 92980917360, 5020969537440, 361509806695680, 26028706082088960, 1874066837910405120, 58110713122393733760, 3643185932897827553280, 393464080752965375754240]

cp's OEIS Frontend

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.

Table of values

List of values