A261227 - cp's OEIS frontend

A261227 a(n) = number of steps to reach 0 when starting from k = n^3 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	2
3	5
4	11
5	20
6	34
7	53
8	78
9	109
10	147
11	191
12	245
13	307
14	378
15	459
16	550
17	653
18	768
19	897
20	1039
21	1196
22	1368
23	1555
24	1758
25	1979
26	2217
27	2473
28	2747
29	3041
30	3354
31	3689
32	4046
33	4424
34	4824
35	5248
36	5697
37	6170
38	6669
39	7194
40	7746
41	8325
42	8934
43	9571
44	10237
45	10935
46	11664
47	12424
48	13216
49	14043
50	14903
51	15798
52	16727
53	17694
54	18696
55	19735
56	20812
57	21929
58	23084
59	24279
60	25514

[0, 1, 2, 5, 11, 20, 34, 53, 78, 109, 147, 191, 245, 307, 378, 459, 550, 653, 768, 897, 1039, 1196, 1368, 1555, 1758, 1979, 2217, 2473, 2747, 3041, 3354, 3689, 4046, 4424, 4824, 5248, 5697, 6170, 6669, 7194, 7746, 8325, 8934, 9571, 10237, 10935, 11664, 12424, 13216, 14043, 14903, 15798, 16727, 17694, 18696, 19735, 20812, 21929, 23084, 24279, 25514]

cp's OEIS Frontend

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