A135610 - cp's OEIS frontend

A135610 Triangle read by rows: the k-th entry of row n is the number of particular connectivity requirements that a k-linked graph with n >= 2k vertices has to satisfy T(n,k) = (1/2) * n!/(k!(n-2k)!) where k runs from 1 to floor(n/2).

n	a(n)
1	1
2	3
3	6
4	6
5	10
6	30
7	15
8	90
9	60
10	21
11	210
12	420
13	28
14	420
15	1680
16	840
17	36
18	756
19	5040
20	7560
21	45
22	1260
23	12600
24	37800
25	15120
26	55
27	1980
28	27720
29	138600
30	166320
31	66
32	2970
33	55440
34	415800
35	997920
36	332640
37	78
38	4290
39	102960
40	1081080
41	4324320
42	4324320
43	91
44	6006

[1, 3, 6, 6, 10, 30, 15, 90, 60, 21, 210, 420, 28, 420, 1680, 840, 36, 756, 5040, 7560, 45, 1260, 12600, 37800, 15120, 55, 1980, 27720, 138600, 166320, 66, 2970, 55440, 415800, 997920, 332640, 78, 4290, 102960, 1081080, 4324320, 4324320, 91, 6006]

cp's OEIS Frontend

A135610 Triangle read by rows: the k-th entry of row n is the number of particular connectivity requirements that a k-linked graph with n >= 2k vertices has to satisfy T(n,k) = (1/2) * n!/(k!(n-2k)!) where k runs from 1 to floor(n/2).

Table of values

List of values

cp's OEIS Frontend

A135610 Triangle read by rows: the k-th entry of row n is the number of particular connectivity requirements that a k-linked graph with n >= 2k vertices has to satisfy T(n,k) = (1/2) * n!/(k!*(n-2*k)!) where k runs from 1 to floor(n/2).

Table of values

List of values

A135610 Triangle read by rows: the k-th entry of row n is the number of particular connectivity requirements that a k-linked graph with n >= 2k vertices has to satisfy T(n,k) = (1/2) * n!/(k!(n-2k)!) where k runs from 1 to floor(n/2).