The number of simple labeled graphs on n nodes where two such graphs are considered equivalent iff one can be obtained from the other by reversing the labeling.
A199574
The number of simple labeled graphs on n nodes where two such graphs are considered equivalent iff one can be obtained from the other by reversing the labeling.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =40a(4) =544a(5) =16640a(6) =1050624a(7) =134250496a(8) =34360262656
External references
- oeis: A199574