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.

A366745 Triangular array, read by rows: T(n,k) = number of partitions p of n such that d(p, p') = 2k, where p' = contraconjugate of p, and d is the distance function defined in A366156.

Table of values

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

List of values

[1, 0, 2, 1, 0, 2, 1, 2, 0, 2, 1, 2, 2, 0, 2, 1, 0, 6, 2, 0, 2, 1, 2, 2, 6, 2, 0, 2, 0, 6, 2, 4, 6, 2, 0, 2, 0, 2, 4, 8, 6, 6, 2, 0, 2, 0, 4, 8, 8, 8, 4, 6, 2, 0, 2, 0, 6, 10, 8, 12, 6, 4, 6, 2, 0, 2, 1, 4, 14, 8, 16, 10, 6, 6, 8, 2, 0, 2, 1, 4, 18, 10, 14, 20, 10, 6, 6, 8, 2, 0, 2, 1, 8, 8, 18, 20, 22, 16, 16, 6, 8, 8, 2, 0, 2, 0, 6, 18, 28, 30, 24, 16, 16, 10, 8, 8, 8, 2, 0, 2, 1, 4, 20, 28, 30, 36, 16, 34, 18, 16, 4, 12, 8, 2, 0, 2]