Complexity of tensor sum of n graphs; or spanning trees on n-cube.
A006237
Complexity of tensor sum of n graphs; or spanning trees on n-cube.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =384a(4) =42467328
External references
- oeis: A006237
A006237
Complexity of tensor sum of n graphs; or spanning trees on n-cube.