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.

A303947 Number of partitions of n into at most 1 copy of 2^2, 2 copies of 3^2, 3 copies of 4^2, ... .

Table of values

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

List of values

[1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 0, 0, 2, 0, 0, 1, 0, 2, 0, 2, 0, 2, 0, 1, 2, 0, 1, 0, 3, 0, 1, 1, 2, 3, 0, 2, 1, 4, 0, 1, 2, 2, 2, 0, 4, 1, 2, 1, 3, 3, 1, 3, 1, 5, 1, 3, 2, 4, 3, 1, 4, 2, 4, 1, 5, 3, 3, 4, 4, 6, 2, 4]