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.

A055401 Number of positive cubes needed to sum to n using the greedy algorithm.

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 6, 7, 8, 9, 10, 4, 5, 6, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 6, 7, 8, 9, 10, 4, 5, 6, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 6, 7]