Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.

A051031

Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.

Terms

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

External references