Number of ways to choose a simple labeled graph on [n], then partition the vertex set into independent sets, then choose a vertex from each independent set.
A371633
Number of ways to choose a simple labeled graph on [n], then partition the vertex set into independent sets, then choose a vertex from each independent set.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =35a(4) =740a(5) =34629a(6) =3581894a(7) =802937479a(8) =386655984648
External references
- oeis: A371633