Triangle T(n,k) = Number of k-cycles on the graph of an n-orthoplex. n>=2, k>=3.

Terms

a(0) =0a(1) =1a(2) =8a(3) =15a(4) =24a(5) =16a(6) =32a(7) =102a(8) =288a(9) =640a(10) =960a(11) =744a(12) =80a(13) =370a(14) =1584a(15) =5920a(16) =18240a(17) =43080a(18) =69120a(19) =56256a(20) =160a(21) =975a(22) =5664a(23) =30080a(24) =141120a(25) =564120a(26) =1835520a(27) =4542336a(28) =7580160a(29) =6385920