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.

A025461 Number of partitions of n into 8 positive cubes.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1]