Maximum number of simple graphs with no isolated vertices on n nodes with identical degree sequences.
A308522
Maximum number of simple graphs with no isolated vertices on n nodes with identical degree sequences.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =5a(5) =20a(6) =184a(7) =3020a(8) =65500
External references
- oeis: A308522