A305059 - cp's OEIS frontend

A305059 Triangle read by rows: T(n,k) is the number of connected unicyclic graphs on n unlabeled nodes with cycle length k and all nodes having degree at most 4.

n	a(n)
3	1
4	1
5	1
6	3
7	1
8	1
9	6
10	4
11	1
12	1
13	15
14	8
15	4
16	1
17	1
18	33
19	24
20	9
21	5
22	1
23	1
24	83
25	55
26	28
27	12
28	5
29	1
30	1
31	196
32	147
33	71
34	40
35	13
36	6
37	1
38	1
39	491
40	365
41	198
42	106
43	47
44	16
45	6
46	1
47	1
48	1214
49	954
50	521
51	317
52	136
53	63
54	18
55	7
56	1
57	1
58	3068
59	2431
60	1418
61	868
62	428
63	190
64	73
65	21
66	7
67	1
68	1

[1, 1, 1, 3, 1, 1, 6, 4, 1, 1, 15, 8, 4, 1, 1, 33, 24, 9, 5, 1, 1, 83, 55, 28, 12, 5, 1, 1, 196, 147, 71, 40, 13, 6, 1, 1, 491, 365, 198, 106, 47, 16, 6, 1, 1, 1214, 954, 521, 317, 136, 63, 18, 7, 1, 1, 3068, 2431, 1418, 868, 428, 190, 73, 21, 7, 1, 1]

cp's OEIS Frontend

A305059 Triangle read by rows: T(n,k) is the number of connected unicyclic graphs on n unlabeled nodes with cycle length k and all nodes having degree at most 4.

Table of values

List of values