cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A261225 n minus the number of positive cubes needed to sum to n using the greedy algorithm: a(n) = n - A055401(n).

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 7, 7, 7, 7, 7, 7, 7, 7, 14, 14, 14, 14, 14, 14, 14, 14, 21, 21, 21, 26, 26, 26, 26, 26, 26, 26, 26, 33, 33, 33, 33, 33, 33, 33, 33, 40, 40, 40, 40, 40, 40, 40, 40, 47, 47, 47, 52, 52, 52, 52, 52, 52, 52, 52, 59, 59, 63, 63, 63, 63, 63, 63, 63, 63, 70, 70, 70, 70, 70, 70, 70, 70, 77, 77, 77, 77, 77, 77, 77, 77, 84, 84, 84, 89]