A144163 - cp's OEIS frontend

A144163 Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph is either a tree or a cycle.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	3
8	3
9	1
10	1
11	6
12	15
13	20
14	3
15	1
16	10
17	45
18	120
19	150
20	12
21	1
22	15
23	105
24	455
25	1185
26	1473
27	70
28	1
29	21
30	210
31	1330
32	5565
33	14469
34	18424
35	465
36	1
37	28
38	378
39	3276
40	19635
41	81060
42	213990
43	280200
44	3507
45	1
46	36
47	630
48	7140
49	57393
50	334656
51	1385076
52	3732300
53	5029218
54	30016

[1, 1, 0, 1, 1, 0, 1, 3, 3, 1, 1, 6, 15, 20, 3, 1, 10, 45, 120, 150, 12, 1, 15, 105, 455, 1185, 1473, 70, 1, 21, 210, 1330, 5565, 14469, 18424, 465, 1, 28, 378, 3276, 19635, 81060, 213990, 280200, 3507, 1, 36, 630, 7140, 57393, 334656, 1385076, 3732300, 5029218, 30016]

cp's OEIS Frontend

A144163 Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph is either a tree or a cycle.

Table of values

List of values