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.

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

List of values

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