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.

A116927 Triangle read by rows: T(n,k) is the number of self-conjugate partitions of n having k 1's (n>=1,k>=0).

Table of values

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

List of values

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