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).
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).
Terms
- a(0) =1a(1) =1a(2) =6a(3) =576a(4) =2073600a(5) =498161664000
External references
- oeis: A255886