A380631 - cp's OEIS frontend

A380631 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and each node a member of exactly one cycle, 0 <= k <= floor(n/3).

n	a(n)
0	1
1	0
2	0
3	0
4	1
5	0
6	1
7	0
8	1
9	0
10	1
11	1
12	0
13	1
14	1
15	0
16	1
17	2
18	0
19	1
20	2
21	2
22	0
23	1
24	3
25	5
26	0
27	1
28	3
29	10
30	0
31	1
32	4
33	17
34	6
35	0
36	1
37	4
38	26
39	18
40	0
41	1
42	5
43	38
44	51
45	0
46	1
47	5
48	52
49	106
50	18
51	0
52	1
53	6
54	70
55	205
56	87
57	0
58	1
59	6
60	90
61	350
62	286
63	0
64	1
65	7
66	115
67	579
68	741
69	66
70	0
71	1
72	7
73	142
74	887
75	1660
76	406

[1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 2, 2, 0, 1, 3, 5, 0, 1, 3, 10, 0, 1, 4, 17, 6, 0, 1, 4, 26, 18, 0, 1, 5, 38, 51, 0, 1, 5, 52, 106, 18, 0, 1, 6, 70, 205, 87, 0, 1, 6, 90, 350, 286, 0, 1, 7, 115, 579, 741, 66, 0, 1, 7, 142, 887, 1660, 406]

cp's OEIS Frontend

A380631 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and each node a member of exactly one cycle, 0 <= k <= floor(n/3).

Table of values

List of values