|
%I #3 Apr 15 2016 18:46:02
%S 1,3,22,384,15536,1473994,314196428,149466458074,157014841181820,
%T 365217955668529232
%N 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 5-1 elements moved to themselves.
%C Column 5 of A271852.
%e Some solutions for n=4
%e .....0........5........0........0........0........0........0........0
%e ....6.3......5.1......6.3......6.3......4.5......5.3......4.5......6.3
%e ...5.6.1....5.4.1....6.2.5....5.2.0....6.1.5....5.0.1....2.6.0....5.2.5
%e ..4.1.2.0..4.4.1.0..2.3.4.1..4.1.0.0..2.3.4.1..4.4.2.0..2.3.3.0..4.1.4.1
%e Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7
%Y Cf. A271852.
%K nonn
%O 1,2
%A _R. H. Hardin_, Apr 15 2016
| 