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.

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

List of values

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