Number of simple graphs on n nodes that are Euler (all nodes even) but not Eulerian (single cycle passes through all edges).
A189771
Number of simple graphs on n nodes that are Euler (all nodes even) but not Eulerian (single cycle passes through all edges).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =2a(7) =7a(8) =20a(9) =76a(10) =334a(11) =2498a(12) =36398a(13) =1225629a(14) =89060804a(15) =12978995815
External references
- oeis: A189771