A235601 - cp's OEIS frontend

A235601 Smallest 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	2
2	12
3	108
4	1944
5	52488
6	1102248
7	44641044
8	2008846980
9	108477736920
10	6508664215200
11	421761441144960
12	22142475660110400
13	1793540528468942400
14	160701231350817239040
15	15909421903730906664960
16	1874419162475932276162560

[1, 2, 12, 108, 1944, 52488, 1102248, 44641044, 2008846980, 108477736920, 6508664215200, 421761441144960, 22142475660110400, 1793540528468942400, 160701231350817239040, 15909421903730906664960, 1874419162475932276162560]

cp's OEIS Frontend

A235601 Smallest 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