A144209 - cp's OEIS frontend

A144209 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 4.

n	a(n)
0	1
1	1
2	0
3	1
4	0
5	0
6	1
7	0
8	0
9	0
10	1
11	0
12	0
13	0
14	3
15	1
16	0
17	0
18	0
19	15
20	60
21	1
22	0
23	0
24	0
25	45
26	360
27	1080
28	1
29	0
30	0
31	0
32	105
33	1260
34	7560
35	20580
36	1
37	0
38	0
39	0
40	210
41	3360
42	30240
43	164640
44	430080
45	1
46	0
47	0
48	0
49	378
50	7560
51	90720
52	740880
53	3873240
54	9920232
55	1
56	0
57	0
58	0
59	630
60	15120
61	226800
62	2469600
63	19367460
64	99406440
65	252000000

[1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 3, 1, 0, 0, 0, 15, 60, 1, 0, 0, 0, 45, 360, 1080, 1, 0, 0, 0, 105, 1260, 7560, 20580, 1, 0, 0, 0, 210, 3360, 30240, 164640, 430080, 1, 0, 0, 0, 378, 7560, 90720, 740880, 3873240, 9920232, 1, 0, 0, 0, 630, 15120, 226800, 2469600, 19367460, 99406440, 252000000]

cp's OEIS Frontend

A144209 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 4.

Table of values

List of values