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.

A343411 Number of ways to write n as x^3 + [y^3/2] + [z^3/3] + 2^w, where [.] is the floor function, x,y,z are positive integers, and w is a nonnegative integer.

Table of values

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

List of values

[0, 1, 1, 1, 2, 1, 2, 1, 4, 1, 4, 3, 2, 3, 4, 5, 2, 7, 2, 2, 2, 5, 4, 5, 5, 3, 3, 3, 3, 7, 6, 3, 5, 5, 6, 2, 11, 3, 6, 2, 6, 6, 8, 10, 2, 9, 2, 5, 5, 10, 5, 2, 6, 4, 4, 7, 5, 7, 2, 2, 4, 6, 7, 3, 12, 3, 7, 4, 9, 6, 5, 10, 4, 15, 4, 8, 5, 11, 4, 8, 14, 6, 4, 6, 10, 7, 8, 9, 5, 6, 4, 4, 13, 5, 7, 3, 10, 2, 7, 11]