Triangle read by rows: T(n,k) is the number of multigraphs without loops on n labeled nodes with k edges and maximum degree 2.

A095693

Triangle read by rows: T(n,k) is the number of multigraphs without loops on n labeled nodes with k edges and maximum degree 2.

Terms

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

External references