A261228 - cp's OEIS frontend

A261228 a(n) = number of steps to reach 0 when starting from k = (n^3)-1 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)
1	0
2	1
3	4
4	10
5	19
6	33
7	52
8	77
9	108
10	146
11	190
12	244
13	306
14	377
15	458
16	549
17	652
18	767
19	896
20	1038
21	1195
22	1367
23	1554
24	1757
25	1978
26	2216
27	2472
28	2746
29	3040
30	3353
31	3688
32	4045
33	4423
34	4823
35	5247
36	5696
37	6169
38	6668
39	7193
40	7745
41	8324
42	8933
43	9570
44	10236
45	10934
46	11663
47	12423
48	13215
49	14042
50	14902
51	15797
52	16726
53	17693
54	18695
55	19734
56	20811
57	21928
58	23083
59	24278
60	25513

[0, 1, 4, 10, 19, 33, 52, 77, 108, 146, 190, 244, 306, 377, 458, 549, 652, 767, 896, 1038, 1195, 1367, 1554, 1757, 1978, 2216, 2472, 2746, 3040, 3353, 3688, 4045, 4423, 4823, 5247, 5696, 6169, 6668, 7193, 7745, 8324, 8933, 9570, 10236, 10934, 11663, 12423, 13215, 14042, 14902, 15797, 16726, 17693, 18695, 19734, 20811, 21928, 23083, 24278, 25513]

cp's OEIS Frontend

A261228 a(n) = number of steps to reach 0 when starting from k = (n^3)-1 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