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 elements moved to themselves.

A271684

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 elements moved to themselves.

Terms

    a(0) =0a(1) =1a(2) =2a(3) =1a(4) =5a(5) =4a(6) =1a(7) =5a(8) =22a(9) =132a(10) =1a(11) =6a(12) =43a(13) =532a(14) =3440a(15) =1a(16) =6a(17) =51a(18) =1060a(19) =19448a(20) =358792a(21) =1a(22) =6a(23) =60a(24) =1564a(25) =52748a(26) =2249488a(27) =71771952a(28) =1a(29) =6

External references