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

A271852

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

Terms

    a(0) =0a(1) =1a(2) =2a(3) =1a(4) =2a(5) =2a(6) =1a(7) =2a(8) =8a(9) =42a(10) =1a(11) =3a(12) =14a(13) =124a(14) =580a(15) =1a(16) =3a(17) =22a(18) =208a(19) =2782a(20) =31892a(21) =1a(22) =3a(23) =22a(24) =304a(25) =6580a(26) =168566a(27) =3193380a(28) =1a(29) =3

External references