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.

A343384 Number of ways to write n as [a^3/3] + [b^3/4] + [c^3/5] + [d^6/6] with a,b,c,d positive integers, where [.] is the floor function.

Table of values

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

List of values

[1, 1, 2, 2, 1, 2, 1, 3, 1, 3, 2, 3, 4, 3, 4, 3, 5, 4, 3, 4, 3, 5, 3, 4, 4, 3, 6, 5, 5, 2, 4, 5, 3, 6, 3, 3, 4, 6, 5, 2, 4, 5, 4, 7, 3, 5, 4, 4, 5, 3, 3, 4, 7, 6, 3, 6, 4, 5, 6, 5, 1, 3, 7, 3, 5, 3, 5, 3, 8, 4, 3, 2, 6, 3, 6, 4, 6, 4, 6, 5, 5, 1, 5, 5, 7, 4, 7, 6, 4, 6, 5, 2, 2, 5, 5, 5, 5, 6, 3, 7, 7]