|
%I #4 Apr 17 2016 09:43:04
%S 1,3,23,445,23145,3135539,1120710711,1054066365149,2612720914804105,
%T 17070666122786078979,294119848655438573724167
%N Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than 1-1 2-cycles.
%C Column 1 of A271969.
%e Some solutions for n=4
%e .....5........0........0........6........5........6........5........0
%e ....6.1......0.6......4.5......2.6......6.1......2.3......5.1......5.3
%e ...5.6.1....0.2.6....2.6.0....2.5.6....6.6.1....5.3.6....5.4.1....6.2.6
%e ..4.1.2.0..0.2.3.3..0.1.3.0..0.1.1.3..2.3.4.1..4.2.2.3..4.4.1.0..0.2.2.3
%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
| 