A261229 - cp's OEIS frontend

A261229 a(n) = number of steps to reach (n^3)-1 when starting from k = ((n+1)^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	1
2	3
3	6
4	9
5	14
6	19
7	25
8	31
9	38
10	44
11	54
12	62
13	71
14	81
15	91
16	103
17	115
18	129
19	142
20	157
21	172
22	187
23	203
24	221
25	238
26	256
27	274
28	294
29	313
30	335
31	357
32	378
33	400
34	424
35	449
36	473
37	499
38	525
39	552
40	579
41	609
42	637
43	666
44	698
45	729
46	760
47	792
48	827
49	860
50	895
51	929
52	967
53	1002
54	1039
55	1077
56	1117
57	1155
58	1195
59	1235
60	1278
61	1318
62	1361
63	1404
64	1448
65	1492
66	1538
67	1583
68	1631
69	1677
70	1725

[1, 3, 6, 9, 14, 19, 25, 31, 38, 44, 54, 62, 71, 81, 91, 103, 115, 129, 142, 157, 172, 187, 203, 221, 238, 256, 274, 294, 313, 335, 357, 378, 400, 424, 449, 473, 499, 525, 552, 579, 609, 637, 666, 698, 729, 760, 792, 827, 860, 895, 929, 967, 1002, 1039, 1077, 1117, 1155, 1195, 1235, 1278, 1318, 1361, 1404, 1448, 1492, 1538, 1583, 1631, 1677, 1725]

cp's OEIS Frontend

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