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.

A281826 Number of ways to write n as x^3 + 2*y^3 + 3*z^3 + p(k), where x,y,z are nonnegative integers, k is a positive integer, and p(.) is the partition function given by A000041.

Table of values

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

List of values

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