A080462 - cp's OEIS frontend

A080462 Define f(k) = Floor [ k/ sum of the digits of k]. Let f(f(...(n))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	2
16	2
17	2
18	1
19	2
20	1
21	1
22	2
23	2
24	1
25	2
26	2
27	1
28	2
29	2
30	1
31	2
32	2
33	2
34	2
35	2
36	1
37	2
38	2
39	2
40	1
41	2
42	1
43	2
44	2
45	1
46	2
47	2
48	1
49	2
50	1
51	2
52	2
53	2
54	1
55	2
56	2
57	2
58	2
59	2
60	1
61	2
62	2
63	1
64	2
65	2
66	2
67	2
68	2
69	2
70	1
71	2
72	1
73	2
74	2
75	2
76	2
77	2
78	2
79	2
80	1
81	1
82	2
83	2
84	1
85	2
86	2
87	2
88	2
89	2
90	1
91	2
92	2
93	2
94	2
95	2
96	2
97	2
98	2
99	2
100	1

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1]

cp's OEIS Frontend

A080462 Define f(k) = Floor [ k/ sum of the digits of k]. Let f(f(...(n))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.

Table of values

List of values

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	2
16	2
17	2
18	1
19	2
20	1
21	1
22	2
23	2
24	1
25	2
26	2
27	1
28	2
29	2
30	1
31	2
32	2
33	2
34	2
35	2
36	1
37	2
38	2
39	2
40	1
41	2
42	1
43	2
44	2
45	1
46	2
47	2
48	1
49	2
50	1
51	2
52	2
53	2
54	1
55	2
56	2
57	2
58	2
59	2
60	1
61	2
62	2
63	1
64	2
65	2
66	2
67	2
68	2
69	2
70	1
71	2
72	1
73	2
74	2
75	2
76	2
77	2
78	2
79	2
80	1
81	1
82	2
83	2
84	1
85	2
86	2
87	2
88	2
89	2
90	1
91	2
92	2
93	2
94	2
95	2
96	2
97	2
98	2
99	2
100	1

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	2
16	2
17	2
18	1
19	2
20	1
21	1
22	2
23	2
24	1
25	2
26	2
27	1
28	2
29	2
30	1
31	2
32	2
33	2
34	2
35	2
36	1
37	2
38	2
39	2
40	1
41	2
42	1
43	2
44	2
45	1
46	2
47	2
48	1
49	2
50	1
51	2
52	2
53	2
54	1
55	2
56	2
57	2
58	2
59	2
60	1
61	2
62	2
63	1
64	2
65	2
66	2
67	2
68	2
69	2
70	1
71	2
72	1
73	2
74	2
75	2
76	2
77	2
78	2
79	2
80	1
81	1
82	2
83	2
84	1
85	2
86	2
87	2
88	2
89	2
90	1
91	2
92	2
93	2
94	2
95	2
96	2
97	2
98	2
99	2
100	1

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	1
13	2
14	2
15	2
16	2
17	2
18	1
19	2
20	1
21	1
22	2
23	2
24	1
25	2
26	2
27	1
28	2
29	2
30	1
31	2
32	2
33	2
34	2
35	2
36	1
37	2
38	2
39	2
40	1
41	2
42	1
43	2
44	2
45	1
46	2
47	2
48	1
49	2
50	1
51	2
52	2
53	2
54	1
55	2
56	2
57	2
58	2
59	2
60	1
61	2
62	2
63	1
64	2
65	2
66	2
67	2
68	2
69	2
70	1
71	2
72	1
73	2
74	2
75	2
76	2
77	2
78	2
79	2
80	1
81	1
82	2
83	2
84	1
85	2
86	2
87	2
88	2
89	2
90	1
91	2
92	2
93	2
94	2
95	2
96	2
97	2
98	2
99	2
100	1