Number of unlabeled connected n-vertex graphs for which the lights out puzzle has a unique solution.
A334443
Number of unlabeled connected n-vertex graphs for which the lights out puzzle has a unique solution.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =2a(4) =9a(5) =33a(6) =290a(7) =3692a(8) =94280a(9) =4454654
External references
- oeis: A334443