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.

A025442 Number of partitions of n into 3 distinct nonzero squares.

Table of values

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

List of values

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