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.

A347534 Number of partitions of n into at most 3 distinct squares.

Table of values

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

List of values

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