A261088 - cp's OEIS frontend

A261088 Number of steps needed to reach zero when starting from k = n^2 and repeatedly applying the map that replaces k with k - d(k), where d(k) is the number of divisors of k (A000005).

n	a(n)
0	0
1	1
2	2
3	3
4	5
5	6
6	10
7	10
8	19
9	15
10	19
11	21
12	24
13	28
14	39
15	33
16	53
17	44
18	49
19	53
20	60
21	61
22	69
23	72
24	79
25	82
26	92
27	93
28	117
29	108
30	115
31	115
32	140
33	121
34	174
35	146
36	205
37	155
38	233
39	217
40	267
41	192
42	295
43	209
44	225
45	222
46	238
47	249
48	267
49	270
50	299
51	290
52	336
53	313
54	373
55	328
56	411
57	347
58	451
59	380
60	486
61	400
62	534
63	422
64	447
65	441
66	460
67	460
68	511
69	479
70	496
71	504
72	545
73	529
74	602
75	553
76	579
77	577
78	626
79	612
80	681
81	632
82	747
83	665
84	796
85	695

[0, 1, 2, 3, 5, 6, 10, 10, 19, 15, 19, 21, 24, 28, 39, 33, 53, 44, 49, 53, 60, 61, 69, 72, 79, 82, 92, 93, 117, 108, 115, 115, 140, 121, 174, 146, 205, 155, 233, 217, 267, 192, 295, 209, 225, 222, 238, 249, 267, 270, 299, 290, 336, 313, 373, 328, 411, 347, 451, 380, 486, 400, 534, 422, 447, 441, 460, 460, 511, 479, 496, 504, 545, 529, 602, 553, 579, 577, 626, 612, 681, 632, 747, 665, 796, 695]

cp's OEIS Frontend

A261088 Number of steps needed to reach zero when starting from k = n^2 and repeatedly applying the map that replaces k with k - d(k), where d(k) is the number of divisors of k (A000005).

Table of values

List of values

n	a(n)
0	0
1	1
2	2
3	3
4	5
5	6
6	10
7	10
8	19
9	15
10	19
11	21
12	24
13	28
14	39
15	33
16	53
17	44
18	49
19	53
20	60
21	61
22	69
23	72
24	79
25	82
26	92
27	93
28	117
29	108
30	115
31	115
32	140
33	121
34	174
35	146
36	205
37	155
38	233
39	217
40	267
41	192
42	295
43	209
44	225
45	222
46	238
47	249
48	267
49	270
50	299
51	290
52	336
53	313
54	373
55	328
56	411
57	347
58	451
59	380
60	486
61	400
62	534
63	422
64	447
65	441
66	460
67	460
68	511
69	479
70	496
71	504
72	545
73	529
74	602
75	553
76	579
77	577
78	626
79	612
80	681
81	632
82	747
83	665
84	796
85	695

n	a(n)
0	0
1	1
2	2
3	3
4	5
5	6
6	10
7	10
8	19
9	15
10	19
11	21
12	24
13	28
14	39
15	33
16	53
17	44
18	49
19	53
20	60
21	61
22	69
23	72
24	79
25	82
26	92
27	93
28	117
29	108
30	115
31	115
32	140
33	121
34	174
35	146
36	205
37	155
38	233
39	217
40	267
41	192
42	295
43	209
44	225
45	222
46	238
47	249
48	267
49	270
50	299
51	290
52	336
53	313
54	373
55	328
56	411
57	347
58	451
59	380
60	486
61	400
62	534
63	422
64	447
65	441
66	460
67	460
68	511
69	479
70	496
71	504
72	545
73	529
74	602
75	553
76	579
77	577
78	626
79	612
80	681
81	632
82	747
83	665
84	796
85	695

n	a(n)
0	0
1	1
2	2
3	3
4	5
5	6
6	10
7	10
8	19
9	15
10	19
11	21
12	24
13	28
14	39
15	33
16	53
17	44
18	49
19	53
20	60
21	61
22	69
23	72
24	79
25	82
26	92
27	93
28	117
29	108
30	115
31	115
32	140
33	121
34	174
35	146
36	205
37	155
38	233
39	217
40	267
41	192
42	295
43	209
44	225
45	222
46	238
47	249
48	267
49	270
50	299
51	290
52	336
53	313
54	373
55	328
56	411
57	347
58	451
59	380
60	486
61	400
62	534
63	422
64	447
65	441
66	460
67	460
68	511
69	479
70	496
71	504
72	545
73	529
74	602
75	553
76	579
77	577
78	626
79	612
80	681
81	632
82	747
83	665
84	796
85	695