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

A186715

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

Terms

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

External references