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.

A025427 Number of partitions of n into 3 nonzero squares.

Table of values

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

List of values

[0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 2, 0, 1, 1, 0, 0, 2, 1, 1, 1, 0, 2, 0, 0, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 2, 0, 1, 3, 0, 1, 2, 0, 2, 0, 1, 2, 0, 0, 1, 3, 1, 1, 2, 1, 0, 1, 1, 2, 2, 1, 2, 1, 0, 0, 3, 1, 2, 1, 0, 3, 0, 1, 3, 2, 1, 0, 1, 2, 0, 1, 1, 2, 3, 0, 3, 2, 0, 1, 2, 1, 2]