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.

A319982 a(n) is the number of integer partitions of n with largest part <= 4 for which the index of the seaweed algebra formed by the integer partition paired with its weight is 0.

Table of values

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

List of values

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