Number of n-node Steinhaus graphs whose complements have at least one cut-vertex.
A007812
Number of n-node Steinhaus graphs whose complements have at least one cut-vertex.
Terms
- a(0) =0a(1) =1a(2) =3a(3) =2a(4) =6a(5) =17a(6) =33a(7) =56a(8) =72a(9) =88a(10) =114a(11) =140a(12) =160a(13) =190a(14) =211a(15) =250a(16) =290a(17) =322a(18) =356a(19) =404a(20) =438a(21) =474a(22) =530a(23) =580a(24) =626a(25) =682a(26) =728
External references
- oeis: A007812