A058879 - cp's OEIS frontend

A058879 Triangle read by rows: T(n,k) = number of connected graphs with one cycle of length m = n - k + 1 and n nodes (n >= 3 and 1 <= k <= n - 2).

n	a(n)
3	1
4	1
5	1
6	1
7	1
8	3
9	1
10	1
11	4
12	7
13	1
14	1
15	4
16	9
17	18
18	1
19	1
20	5
21	10
22	28
23	44
24	1
25	1
26	5
27	13
28	32
29	71
30	117
31	1
32	1
33	6
34	14
35	45
36	89
37	202
38	299
39	1
40	1
41	6
42	17
43	52
44	130
45	264
46	542
47	793
48	1
49	1
50	7
51	19
52	69
53	163
54	413
55	751
56	1507
57	2095
58	1
59	1
60	7
61	22
62	79
63	224
64	544
65	1221
66	2179
67	4114
68	5607

[1, 1, 1, 1, 1, 3, 1, 1, 4, 7, 1, 1, 4, 9, 18, 1, 1, 5, 10, 28, 44, 1, 1, 5, 13, 32, 71, 117, 1, 1, 6, 14, 45, 89, 202, 299, 1, 1, 6, 17, 52, 130, 264, 542, 793, 1, 1, 7, 19, 69, 163, 413, 751, 1507, 2095, 1, 1, 7, 22, 79, 224, 544, 1221, 2179, 4114, 5607]

cp's OEIS Frontend

A058879 Triangle read by rows: T(n,k) = number of connected graphs with one cycle of length m = n - k + 1 and n nodes (n >= 3 and 1 <= k <= n - 2).

Table of values

List of values