Irregular triangle C(n,k): the number of connected k-regular graphs on n vertices having girth at least six.

A186716

Irregular triangle C(n,k): the number of connected k-regular graphs on n vertices having girth at least six.

Terms

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

External references