A144228 - cp's OEIS frontend

A144228 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 has at most one 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	15
15	1
16	10
17	45
18	120
19	210
20	222
21	1
22	15
23	105
24	455
25	1365
26	2913
27	3670
28	1
29	21
30	210
31	1330
32	5985
33	20139
34	49294
35	68820
36	1
37	28
38	378
39	3276
40	20475
41	97860
42	362670
43	976560
44	1456875
45	1
46	36
47	630
48	7140
49	58905
50	376236
51	1914276
52	7663500
53	22089870
54	34506640

[1, 1, 0, 1, 1, 0, 1, 3, 3, 1, 1, 6, 15, 20, 15, 1, 10, 45, 120, 210, 222, 1, 15, 105, 455, 1365, 2913, 3670, 1, 21, 210, 1330, 5985, 20139, 49294, 68820, 1, 28, 378, 3276, 20475, 97860, 362670, 976560, 1456875, 1, 36, 630, 7140, 58905, 376236, 1914276, 7663500, 22089870, 34506640]

cp's OEIS Frontend

A144228 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 has at most one cycle.

Table of values

List of values