A217781 - cp's OEIS frontend

A217781 Triangular array read by rows: T(n,k) is the number of n-node connected graphs with exactly one cycle of length k (and no other cycles) for n >= 1 and 1 <= k <= n.

n	a(n)
1	1
2	1
3	1
4	2
5	1
6	1
7	4
8	3
9	1
10	1
11	9
12	6
13	3
14	1
15	1
16	20
17	16
18	7
19	4
20	1
21	1
22	48
23	37
24	18
25	9
26	4
27	1
28	1
29	115
30	96
31	44
32	28
33	10
34	5
35	1
36	1
37	286
38	239
39	117
40	71
41	32
42	13
43	5
44	1
45	1
46	719
47	622
48	299
49	202
50	89
51	45
52	14
53	6
54	1
55	1
56	1842
57	1607
58	793
59	542
60	264
61	130
62	52
63	17
64	6
65	1
66	1

[1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 9, 6, 3, 1, 1, 20, 16, 7, 4, 1, 1, 48, 37, 18, 9, 4, 1, 1, 115, 96, 44, 28, 10, 5, 1, 1, 286, 239, 117, 71, 32, 13, 5, 1, 1, 719, 622, 299, 202, 89, 45, 14, 6, 1, 1, 1842, 1607, 793, 542, 264, 130, 52, 17, 6, 1, 1]

cp's OEIS Frontend

A217781 Triangular array read by rows: T(n,k) is the number of n-node connected graphs with exactly one cycle of length k (and no other cycles) for n >= 1 and 1 <= k <= n.

Table of values

List of values