Triangle read by rows: T(n, k) is the number of cycles of length n with k descents in a complete graph on n nodes.

A387937

Triangle read by rows: T(n, k) is the number of cycles of length n with k descents in a complete graph on n nodes.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =19a(5) =1a(6) =1a(7) =101a(8) =101a(9) =1a(10) =1a(11) =426a(12) =1751a(13) =426a(14) =1a(15) =1a(16) =1667a(17) =18327a(18) =18327a(19) =1667a(20) =1a(21) =1a(22) =6371a(23) =154645a(24) =398567a(25) =154645a(26) =6371a(27) =1a(28) =1a(29) =24229

External references