A125205 - cp's OEIS frontend

A125205 Irregular triangle read by rows T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs (V,E') with |E'|=k of the complete labeled graph K_n=(V,E).

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

[1, 2, 1, 3, 6, 3, 1, 4, 18, 30, 24, 15, 6, 1, 5, 40, 135, 250, 295, 282, 215, 120, 45, 10, 1, 6, 75, 420, 1385, 3015, 4800, 6365, 7170, 6705, 5065, 3009, 1365, 455, 105, 15, 1, 7, 126, 1050, 5355, 18690, 47880, 96796, 166890, 251370, 329945, 373947, 362292, 297115]

cp's OEIS Frontend

A125205 Irregular triangle read by rows T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs (V,E') with |E'|=k of the complete labeled graph K_n=(V,E).

Table of values

List of values