Triangle read by rows: T(n,k) = number of circuits of length k in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n(n-1)/2.

A357887

Triangle read by rows: T(n,k) = number of circuits of length k in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n(n-1)/2.

Terms

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

External references