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.

A025441 Number of partitions of n into 2 distinct nonzero squares.

Table of values

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

List of values

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