|
%I #3 Apr 17 2016 09:43:49
%S 1,6,59,1828,133056,25994687,12952862226,16738437591113,
%T 55931128658191675,484527223323003786960
%N Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than 3-1 2-cycles.
%C Column 3 of A271969.
%e Some solutions for n=4
%e .....5........5........5........0........5........5........5........0
%e ....2.6......2.6......5.1......0.5......4.1......2.5......5.1......6.0
%e ...6.2.3....4.5.1....6.2.0....5.5.1....5.6.0....6.3.1....5.4.1....6.1.5
%e ..2.3.4.3..0.1.0.0..0.2.0.0..2.4.2.0..2.0.1.0..0.4.2.0..4.2.4.3..2.3.4.1
%e Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7
%Y Cf. A271969.
%K nonn
%O 1,2
%A _R. H. Hardin_, Apr 17 2016
| 