|
%I #3 Apr 15 2016 18:45:38
%S 1,3,22,304,11246,932092,170786194,70031967880,63448846953258,
%T 128002469163212148
%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 4-1 elements moved to themselves.
%C Column 4 of A271852.
%e Some solutions for n=4
%e .....0........0........6........6........0........5........6........6
%e ....4.6......5.0......2.3......2.3......4.6......6.1......2.3......2.5
%e ...6.1.3....5.1.3....4.4.5....0.6.3....2.5.3....5.2.5....6.0.5....6.1.5
%e ..2.3.0.0..4.4.2.0..0.1.3.0..0.0.4.1..2.3.0.0..4.1.4.1..2.3.4.1..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. A271852.
%K nonn
%O 1,2
%A _R. H. Hardin_, Apr 15 2016
| 