A143018 - cp's OEIS frontend

A143018 Triangle read by rows: T(n,k) (n >= 2, k >= 1) is the number of non-crossing connected graphs on n nodes on a circle such that the distance from a fixed node (root) to the next node is k. Rows are indexed 2,3,4,...; columns are indexed 1,2,3, ... .

n	a(n)
2	1
3	3
4	1
5	16
6	6
7	1
8	105
9	41
10	9
11	1
12	768
13	306
14	75
15	12
16	1
17	6006
18	2422
19	630
20	118
21	15
22	1
23	49152
24	19980
25	5394
26	1104
27	170
28	18
29	1
30	415701
31	169941
32	47061
33	10197
34	1755
35	231
36	21
37	1
38	3604480
39	1479786
40	417439
41	94116
42	17425
43	2610
44	301
45	24
46	1

[1, 3, 1, 16, 6, 1, 105, 41, 9, 1, 768, 306, 75, 12, 1, 6006, 2422, 630, 118, 15, 1, 49152, 19980, 5394, 1104, 170, 18, 1, 415701, 169941, 47061, 10197, 1755, 231, 21, 1, 3604480, 1479786, 417439, 94116, 17425, 2610, 301, 24, 1]

cp's OEIS Frontend

A143018 Triangle read by rows: T(n,k) (n >= 2, k >= 1) is the number of non-crossing connected graphs on n nodes on a circle such that the distance from a fixed node (root) to the next node is k. Rows are indexed 2,3,4,...; columns are indexed 1,2,3, ... .

Table of values

List of values