Number of ways to linearly order the connected components of a simple labeled graph on n nodes.
A335356
Number of ways to linearly order the connected components of a simple labeled graph on n nodes.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =16a(4) =136a(5) =1878a(6) =47370a(7) =2510396a(8) =291566024a(9) =71549525888
External references
- oeis: A335356