A144207 - cp's OEIS frontend

A144207 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 consists of a single node or has a unique cycle of length 3.

n	a(n)
0	1
1	1
2	0
3	1
4	0
5	0
6	1
7	0
8	0
9	1
10	1
11	0
12	0
13	4
14	12
15	1
16	0
17	0
18	10
19	60
20	150
21	1
22	0
23	0
24	20
25	180
26	900
27	2160
28	1
29	0
30	0
31	35
32	420
33	3150
34	15180
35	36015
36	1
37	0
38	0
39	56
40	840
41	8400
42	60750
43	291060
44	688128
45	1
46	0
47	0
48	84
49	1512
50	18900
51	182270
52	1311240
53	6300672
54	14880348
55	1
56	0
57	0
58	120
59	2520
60	37800

[1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 4, 12, 1, 0, 0, 10, 60, 150, 1, 0, 0, 20, 180, 900, 2160, 1, 0, 0, 35, 420, 3150, 15180, 36015, 1, 0, 0, 56, 840, 8400, 60750, 291060, 688128, 1, 0, 0, 84, 1512, 18900, 182270, 1311240, 6300672, 14880348, 1, 0, 0, 120, 2520, 37800]

cp's OEIS Frontend

A144207 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 consists of a single node or has a unique cycle of length 3.

Table of values

List of values