A060630 - cp's OEIS frontend

A060630 a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.

n	a(n)
0	0
1	1
2	10
3	19
4	109
5	149
6	197
7	399
8	694
9	796
10	893
11	897
12	1167
13	1579
14	1596
15	1667
16	1790
17	1777
18	2859
19	1779
20	1778
21	1873
22	3679
23	5926
24	11289
25	9539
26	13551
27	4589
28	5960
29	12066
30	12265
31	19119
32	10927
33	12379
34	11742
35	65220
36	34038
37	40390
38	1110025
39	10100023

[0, 1, 10, 19, 109, 149, 197, 399, 694, 796, 893, 897, 1167, 1579, 1596, 1667, 1790, 1777, 2859, 1779, 1778, 1873, 3679, 5926, 11289, 9539, 13551, 4589, 5960, 12066, 12265, 19119, 10927, 12379, 11742, 65220, 34038, 40390, 1110025, 10100023]

cp's OEIS Frontend

A060630 a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.

Table of values

List of values