A125206 - cp's OEIS frontend

A125206 Triangular array T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs obtained from the complete labeled graph K_n by removing k edges.

n	a(n)
1	1
2	1
3	2
4	1
5	3
6	6
7	3
8	1
9	6
10	15
11	24
12	30
13	18
14	4
15	1
16	10
17	45
18	120
19	215
20	282
21	295
22	250
23	135
24	40
25	5
26	1
27	15
28	105
29	455
30	1365
31	3009
32	5065
33	6705
34	7170
35	6365
36	4800
37	3015
38	1385
39	420
40	75
41	6
42	1
43	21
44	210
45	1330
46	5985
47	20349
48	54271
49	116385
50	204225
51	297115
52	362292
53	373947
54	329945

[1, 1, 2, 1, 3, 6, 3, 1, 6, 15, 24, 30, 18, 4, 1, 10, 45, 120, 215, 282, 295, 250, 135, 40, 5, 1, 15, 105, 455, 1365, 3009, 5065, 6705, 7170, 6365, 4800, 3015, 1385, 420, 75, 6, 1, 21, 210, 1330, 5985, 20349, 54271, 116385, 204225, 297115, 362292, 373947, 329945]

cp's OEIS Frontend

A125206 Triangular array T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs obtained from the complete labeled graph K_n by removing k edges.

Table of values

List of values