A255886 - cp's OEIS frontend

A255886 Number of orderings of the edges of the labeled complete graph K_n such that the graph induced by the first k edges is connected for every k=1,2,...,binomial(n,2).

n	a(n)
1	1
2	1
3	6
4	576
5	2073600
6	498161664000
7	12385682950717440000
8	45484508287062207627264000000
9	33297304775599549535597153400913920000000
10	6298496203530014357849150420174490961843322880000000000
11	387030157006015555733158587399026951851936435957496524308480000000000000

[1, 1, 6, 576, 2073600, 498161664000, 12385682950717440000, 45484508287062207627264000000, 33297304775599549535597153400913920000000, 6298496203530014357849150420174490961843322880000000000, 387030157006015555733158587399026951851936435957496524308480000000000000]

cp's OEIS Frontend

A255886 Number of orderings of the edges of the labeled complete graph K_n such that the graph induced by the first k edges is connected for every k=1,2,...,binomial(n,2).

Table of values

List of values