A300705 - cp's OEIS frontend

A300705 Triangle T(n,k) read by rows: the number of n-node connected graphs with k components with no cycles of length less than 5.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	1
8	1
9	1
10	0
11	2
12	2
13	1
14	1
15	0
16	4
17	3
18	2
19	1
20	1
21	0
22	8
23	7
24	4
25	2
26	1
27	1
28	0
29	18
30	14
31	8
32	4
33	2
34	1
35	1
36	0
37	47
38	33
39	17
40	9
41	4
42	2
43	1
44	1
45	0
46	137
47	81
48	40
49	18
50	9
51	4
52	2
53	1
54	1
55	0
56	464
57	228
58	98
59	43
60	19
61	9
62	4
63	2
64	1
65	1
66	0
67	1793
68	716
69	269
70	105
71	44
72	19
73	9
74	4
75	2
76	1
77	1
78	0
79	8167
80	2596
81	827
82	287
83	108
84	45
85	19
86	9
87	4
88	2
89	1
90	1
91	0

[1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 2, 1, 1, 0, 4, 3, 2, 1, 1, 0, 8, 7, 4, 2, 1, 1, 0, 18, 14, 8, 4, 2, 1, 1, 0, 47, 33, 17, 9, 4, 2, 1, 1, 0, 137, 81, 40, 18, 9, 4, 2, 1, 1, 0, 464, 228, 98, 43, 19, 9, 4, 2, 1, 1, 0, 1793, 716, 269, 105, 44, 19, 9, 4, 2, 1, 1, 0, 8167, 2596, 827, 287, 108, 45, 19, 9, 4, 2, 1, 1, 0]

cp's OEIS Frontend

A300705 Triangle T(n,k) read by rows: the number of n-node connected graphs with k components with no cycles of length less than 5.

Table of values

List of values