A261226 - cp's OEIS frontend

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

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

[0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 16]

cp's OEIS Frontend

A261226 a(n) = number of steps to reach 0 when starting from k = n and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes 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	1
5	1
6	1
7	1
8	2
9	2
10	2
11	2
12	2
13	2
14	2
15	2
16	3
17	3
18	3
19	3
20	3
21	3
22	3
23	3
24	4
25	4
26	4
27	5
28	5
29	5
30	5
31	5
32	5
33	5
34	5
35	6
36	6
37	6
38	6
39	6
40	6
41	6
42	6
43	7
44	7
45	7
46	7
47	7
48	7
49	7
50	7
51	8
52	8
53	8
54	9
55	9
56	9
57	9
58	9
59	9
60	9
61	9
62	10
63	10
64	11
65	11
66	11
67	11
68	11
69	11
70	11
71	11
72	12
73	12
74	12
75	12
76	12
77	12
78	12
79	12
80	13
81	13
82	13
83	13
84	13
85	13
86	13
87	13
88	14
89	14
90	14
91	15
92	15
93	15
94	15
95	15
96	15
97	15
98	15
99	16

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

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