Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth exactly 3.
A210703
Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth exactly 3.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =1a(9) =0a(10) =0a(11) =1a(12) =0a(13) =0a(14) =1a(15) =1a(16) =0a(17) =0a(18) =2a(19) =0a(20) =0a(21) =0a(22) =2a(23) =2a(24) =1a(25) =0a(26) =0a(27) =3a(28) =0a(29) =1
External references
- oeis: A210703