A340030 - cp's OEIS frontend

A340030 Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with k edges and all vertices having even degree, 0 <= k < 2^n.

n	a(n)
0	1
1	1
2	0
3	1
4	0
5	0
6	1
7	1
8	0
9	0
10	7
11	7
12	0
13	0
14	1
15	1
16	0
17	0
18	35
19	105
20	168
21	280
22	435
23	435
24	280
25	168
26	105
27	35
28	0
29	0
30	1
31	1
32	0
33	0
34	155
35	1085
36	5208
37	22568
38	82615
39	247845
40	628680
41	1383096
42	2648919
43	4414865
44	6440560
45	8280720
46	9398115
47	9398115
48	8280720
49	6440560
50	4414865
51	2648919
52	1383096
53	628680
54	247845
55	82615
56	22568
57	5208
58	1085
59	155
60	0
61	0
62	1

[1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 7, 7, 0, 0, 1, 1, 0, 0, 35, 105, 168, 280, 435, 435, 280, 168, 105, 35, 0, 0, 1, 1, 0, 0, 155, 1085, 5208, 22568, 82615, 247845, 628680, 1383096, 2648919, 4414865, 6440560, 8280720, 9398115, 9398115, 8280720, 6440560, 4414865, 2648919, 1383096, 628680, 247845, 82615, 22568, 5208, 1085, 155, 0, 0, 1]

cp's OEIS Frontend

A340030 Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with k edges and all vertices having even degree, 0 <= k < 2^n.

Table of values

List of values