A127537 - cp's OEIS frontend

A127537 Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= 2n-3) is the number of non-crossing connected graphs on n nodes on a circle, having k edges. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....

n	a(n)
2	1
3	0
4	3
5	1
6	0
7	0
8	12
9	9
10	2
11	0
12	0
13	0
14	55
15	66
16	30
17	5
18	0
19	0
20	0
21	0
22	273
23	455
24	315
25	105
26	14
27	0
28	0
29	0
30	0
31	0
32	1428
33	3060
34	2856
35	1428
36	378
37	42
38	0
39	0
40	0
41	0
42	0
43	0
44	7752
45	20349
46	23940
47	15960
48	6300
49	1386
50	132
51	0
52	0
53	0
54	0
55	0
56	0
57	0
58	43263
59	134596
60	191268
61	159390
62	83490
63	27324
64	5148
65	429

[1, 0, 3, 1, 0, 0, 12, 9, 2, 0, 0, 0, 55, 66, 30, 5, 0, 0, 0, 0, 273, 455, 315, 105, 14, 0, 0, 0, 0, 0, 1428, 3060, 2856, 1428, 378, 42, 0, 0, 0, 0, 0, 0, 7752, 20349, 23940, 15960, 6300, 1386, 132, 0, 0, 0, 0, 0, 0, 0, 43263, 134596, 191268, 159390, 83490, 27324, 5148, 429]

cp's OEIS Frontend

A127537 Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= 2n-3) is the number of non-crossing connected graphs on n nodes on a circle, having k edges. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....

Table of values

List of values