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.

A341941 T(n,k) is the number of unlabeled even graphs with n vertices and k edges; irregular triangular array T read by rows (n >= 0, 0 <= k <= n*(n-1)/2).

Table of values

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

List of values

[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 3, 2, 2, 1, 2, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 3, 4, 4, 6, 6, 6, 6, 4, 4, 3, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 3, 4, 7, 9, 16, 18, 25, 24, 29, 26, 25, 16, 15, 8, 5, 4, 3, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 3, 4, 7, 13, 21, 36, 58, 83, 118, 156, 189, 213, 228, 213, 189, 156, 118, 83, 58, 36, 21, 13, 7, 4, 3, 1, 1, 1, 0, 0, 1]