A143024 - cp's OEIS frontend

A143024 Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle having root (a distinguished node) of degree 1 and having k edges (n >= 2, 1 <= k <= 2n-4).

n	a(n)
2	1
3	0
4	2
5	0
6	0
7	7
8	2
9	0
10	0
11	0
12	30
13	20
14	4
15	0
16	0
17	0
18	0
19	143
20	156
21	65
22	10
23	0
24	0
25	0
26	0
27	0
28	728
29	1120
30	720
31	224
32	28
33	0
34	0
35	0
36	0
37	0
38	0
39	3876
40	7752
41	6783
42	3192
43	798
44	84
45	0
46	0
47	0
48	0
49	0
50	0
51	0
52	21318
53	52668
54	58520
55	36960
56	13860
57	2904
58	264
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	0
67	120175
68	354200
69	478170

[1, 0, 2, 0, 0, 7, 2, 0, 0, 0, 30, 20, 4, 0, 0, 0, 0, 143, 156, 65, 10, 0, 0, 0, 0, 0, 728, 1120, 720, 224, 28, 0, 0, 0, 0, 0, 0, 3876, 7752, 6783, 3192, 798, 84, 0, 0, 0, 0, 0, 0, 0, 21318, 52668, 58520, 36960, 13860, 2904, 264, 0, 0, 0, 0, 0, 0, 0, 0, 120175, 354200, 478170]

cp's OEIS Frontend

A143024 Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle having root (a distinguished node) of degree 1 and having k edges (n >= 2, 1 <= k <= 2n-4).

Table of values

List of values