A143022 - cp's OEIS frontend

A143022 Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1).

n	a(n)
2	1
3	2
4	2
5	9
6	10
7	4
8	54
9	62
10	32
11	8
12	374
13	436
14	248
15	88
16	16
17	2820
18	3316
19	1984
20	816
21	224
22	32
23	22485
24	26586
25	16404
26	7320
27	2416
28	544
29	64
30	186494
31	221350
32	139424
33	65512
34	24032
35	6688
36	1280
37	128
38	1592778
39	1895740
40	1211848
41	590040
42	231824
43	73088
44	17664
45	2944

[1, 2, 2, 9, 10, 4, 54, 62, 32, 8, 374, 436, 248, 88, 16, 2820, 3316, 1984, 816, 224, 32, 22485, 26586, 16404, 7320, 2416, 544, 64, 186494, 221350, 139424, 65512, 24032, 6688, 1280, 128, 1592778, 1895740, 1211848, 590040, 231824, 73088, 17664, 2944]

cp's OEIS Frontend

A143022 Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1).

Table of values

List of values