A201013 - cp's OEIS frontend

A201013 Triangular array read by rows: T(n,k) is the number of 2-regular labeled graphs on n nodes that have exactly k connected components (cycles); n>=3, 1<=k<=floor(n/3).

n	a(n)
3	1
4	3
5	12
6	60
7	10
8	360
9	105
10	2520
11	987
12	20160
13	9576
14	280
15	181440
16	99144
17	6300
18	1814400
19	1104840
20	107415
21	19958400
22	13262040
23	1708245
24	15400
25	239500800
26	171119520
27	27042444
28	600600
29	3113510400
30	2366076960
31	437729292
32	16186170
33	43589145600
34	34941291840
35	7335055728
36	382056675
37	1401400

[1, 3, 12, 60, 10, 360, 105, 2520, 987, 20160, 9576, 280, 181440, 99144, 6300, 1814400, 1104840, 107415, 19958400, 13262040, 1708245, 15400, 239500800, 171119520, 27042444, 600600, 3113510400, 2366076960, 437729292, 16186170, 43589145600, 34941291840, 7335055728, 382056675, 1401400]

cp's OEIS Frontend

A201013 Triangular array read by rows: T(n,k) is the number of 2-regular labeled graphs on n nodes that have exactly k connected components (cycles); n>=3, 1<=k<=floor(n/3).

Table of values

List of values