A348070 - cp's OEIS frontend

A348070 Triangular array read by rows: T(n,k) is the number of undirected 2-regular labeled graphs whose largest connected component has exactly k nodes; n >= 1, 1 <= k <= n.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	1
7	0
8	0
9	0
10	3
11	0
12	0
13	0
14	0
15	12
16	0
17	0
18	10
19	0
20	0
21	60
22	0
23	0
24	0
25	105
26	0
27	0
28	360
29	0
30	0
31	0
32	315
33	672
34	0
35	0
36	2520
37	0
38	0
39	280
40	0
41	4536
42	5040
43	0
44	0
45	20160
46	0
47	0
48	0
49	6300
50	18144
51	37800
52	43200
53	0
54	0
55	181440
56	0
57	0
58	0
59	51975
60	55440
61	332640
62	356400
63	415800
64	0
65	0
66	1814400

[0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 12, 0, 0, 10, 0, 0, 60, 0, 0, 0, 105, 0, 0, 360, 0, 0, 0, 315, 672, 0, 0, 2520, 0, 0, 280, 0, 4536, 5040, 0, 0, 20160, 0, 0, 0, 6300, 18144, 37800, 43200, 0, 0, 181440, 0, 0, 0, 51975, 55440, 332640, 356400, 415800, 0, 0, 1814400]

cp's OEIS Frontend

A348070 Triangular array read by rows: T(n,k) is the number of undirected 2-regular labeled graphs whose largest connected component has exactly k nodes; n >= 1, 1 <= k <= n.

Table of values

List of values