|
%I #3 Apr 15 2016 18:45:17
%S 1,2,14,208,6580,471344,72638356,25380585434,19661137065252,
%T 34212157566464184
%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 3-1 elements moved to themselves.
%C Column 3 of A271852.
%e Some solutions for n=4
%e .....6........6........5........0........0........6........6........5
%e ....2.6......2.5......4.1......6.3......4.6......2.3......2.6......4.1
%e ...4.1.5....2.6.0....5.3.3....5.6.1....5.1.6....4.4.6....5.1.3....5.0.5
%e ..0.1.3.0..2.3.3.0..4.4.2.0..4.1.4.1..4.1.1.3..2.3.3.3..4.1.0.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
| 