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.

A321223 a(n) is the number of recursively self-conjugate partitions of n.

Table of values

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

List of values

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