Triangular array C(n, k) = number of connected k-regular graphs, having girth at least 4, with n nodes, 0 <= k <= n div 2.

A186714

Triangular array C(n, k) = number of connected k-regular graphs, having girth at least 4, with n nodes, 0 <= k <= n div 2.

Terms

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

External references