Total counts of distinct (directed) Hamiltonian paths for all simple graphs of order n.
A193352
Total counts of distinct (directed) Hamiltonian paths for all simple graphs of order n.
Terms
- a(0) =0a(1) =2a(2) =8a(3) =50a(4) =416a(5) =5616a(6) =117308a(7) =4862736a(8) =435732112a(9) =89647085656
External references
- oeis: A193352