A181664 - cp's OEIS frontend

A181664 Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.

n	a(n)
1	15
2	19
3	14
4	28
5	23
6	16
7	22
8	65
9	55
10	142
11	134
12	130
13	119
14	109
15	95
16	79
17	71
18	58
19	47
20	37
21	32
22	25
23	17
24	13
25	11
26	44
27	256
28	245
29	235
30	815
31	1313
32	1489
33	1469
34	1510
35	1493
36	1480
37	1829
38	1828
39	1814
40	1789
41	1772
42	3115
43	4295
44	4276
45	4262
46	4246
47	4229
48	4216
49	4196
50	4177
51	4163
52	4147
53	4183
54	4166
55	4153
56	4142
57	4132
58	4118
59	4111
60	4094
61	4081
62	8914
63	8885
64	8857
65	8834
66	8809
67	8783
68	8761
69	8741
70	8722
71	8699
72	8674
73	8648
74	8626
75	8597
76	8569
77	8546
78	8530
79	8513
80	8491
81	8471
82	8452
83	8429
84	8413
85	8387
86	8365
87	8345
88	8326
89	8312
90	8287
91	8270
92	8248
93	8228
94	8209
95	8186
96	8170
97	8153
98	8140
99	31085
100	31072

[15, 19, 14, 28, 23, 16, 22, 65, 55, 142, 134, 130, 119, 109, 95, 79, 71, 58, 47, 37, 32, 25, 17, 13, 11, 44, 256, 245, 235, 815, 1313, 1489, 1469, 1510, 1493, 1480, 1829, 1828, 1814, 1789, 1772, 3115, 4295, 4276, 4262, 4246, 4229, 4216, 4196, 4177, 4163, 4147, 4183, 4166, 4153, 4142, 4132, 4118, 4111, 4094, 4081, 8914, 8885, 8857, 8834, 8809, 8783, 8761, 8741, 8722, 8699, 8674, 8648, 8626, 8597, 8569, 8546, 8530, 8513, 8491, 8471, 8452, 8429, 8413, 8387, 8365, 8345, 8326, 8312, 8287, 8270, 8248, 8228, 8209, 8186, 8170, 8153, 8140, 31085, 31072]

cp's OEIS Frontend

A181664 Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.

Table of values

List of values