T(n,k)=Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than k-1 2-cycles.

A271969

T(n,k)=Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than k-1 2-cycles.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =1a(4) =6a(5) =23a(6) =1a(7) =6a(8) =44a(9) =445a(10) =1a(11) =6a(12) =59a(13) =1207a(14) =23145a(15) =1a(16) =6a(17) =61a(18) =1828a(19) =74247a(20) =3135539a(21) =1a(22) =6a(23) =61a(24) =2153a(25) =133056a(26) =12282848a(27) =1120710711a(28) =1a(29) =6

External references