|
%I #5 Apr 12 2016 09:02:17
%S 1,5,43,1060,52748,7094704,2145306564,1620658809592,2911303191478512,
%T 12781455928074495792
%N Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than 3-1 elements moved to themselves.
%C Column 3 of A271684.
%e Some solutions for n=4
%e .....0........6........5........5........0........5........5........6
%e ....6.3......0.1......4.1......2.5......4.3......2.5......2.0......2.5
%e ...5.5.1....5.5.6....6.0.6....5.5.1....5.5.0....5.2.5....0.4.6....2.4.5
%e ..2.4.2.0..2.2.2.3..2.3.2.3..2.4.4.1..2.2.4.3..4.1.4.1..4.3.1.3..0.1.3.0
%e Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7
%Y Cf. A271684.
%K nonn
%O 1,2
%A _R. H. Hardin_, Apr 12 2016
| 