Complexity (number of maximal spanning trees) in an unoriented simple graph with nodes {1,2,...,n} and edges {i,j} if i + j > n.
A107991
Complexity (number of maximal spanning trees) in an unoriented simple graph with nodes {1,2,...,n} and edges {i,j} if i + j > n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =8a(5) =40a(6) =180a(7) =1260a(8) =8064a(9) =72576a(10) =604800a(11) =6652800a(12) =68428800a(13) =889574400a(14) =10897286400a(15) =163459296000
External references
- oeis: A107991