A144161 - cp's OEIS frontend

A144161 Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs.

n	a(n)
0	1
1	1
2	0
3	1
4	0
5	0
6	1
7	0
8	0
9	1
10	1
11	0
12	0
13	4
14	3
15	1
16	0
17	0
18	10
19	15
20	12
21	1
22	0
23	0
24	20
25	45
26	72
27	70
28	1
29	0
30	0
31	35
32	105
33	252
34	490
35	465
36	1
37	0
38	0
39	56
40	210
41	672
42	1960
43	3720
44	3507
45	1
46	0
47	0
48	84
49	378
50	1512
51	5880
52	16740
53	31563
54	30016
55	1
56	0
57	0
58	120
59	630
60	3024
61	14700
62	55800
63	157815
64	300160
65	286884

[1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 4, 3, 1, 0, 0, 10, 15, 12, 1, 0, 0, 20, 45, 72, 70, 1, 0, 0, 35, 105, 252, 490, 465, 1, 0, 0, 56, 210, 672, 1960, 3720, 3507, 1, 0, 0, 84, 378, 1512, 5880, 16740, 31563, 30016, 1, 0, 0, 120, 630, 3024, 14700, 55800, 157815, 300160, 286884]

cp's OEIS Frontend

A144161 Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs.

Table of values

List of values