A261221 - cp's OEIS frontend

A261221 a(n) = number of steps to reach 0 when starting from k = n and repeatedly applying the map that replaces k with k - A053610(k), where A053610(k) = the number of positive squares needed to sum to k using the greedy algorithm.

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

[0, 1, 1, 1, 2, 2, 2, 2, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 21, 22, 22, 22, 23, 24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 26, 27, 27, 27, 28, 28, 28, 29]

cp's OEIS Frontend

A261221 a(n) = number of steps to reach 0 when starting from k = n and repeatedly applying the map that replaces k with k - A053610(k), where A053610(k) = the number of positive squares needed to sum to k using the greedy algorithm.

Table of values

List of values

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

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

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