Maximum number of spanning trees in a cubic graph on 2n vertices.

A108941

Maximum number of spanning trees in a cubic graph on 2n vertices.

Terms

    a(0) =16a(1) =81a(2) =392a(3) =2000a(4) =9800a(5) =50421a(6) =248832a(7) =1265625a(8) =6422000a(9) =32710656

External references