Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 4.

A185204

Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 4.

Terms

    a(0) =0a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =0a(7) =1a(8) =1a(9) =1a(10) =0a(11) =1a(12) =1a(13) =1a(14) =1a(15) =0a(16) =1a(17) =1a(18) =1a(19) =2a(20) =1a(21) =0a(22) =2a(23) =1a(24) =1a(25) =4a(26) =1a(27) =1a(28) =0a(29) =4

External references