|
%I #5 Apr 12 2016 09:01:46
%S 1,6,51,1564,96249,15313428,5570048178,4945752615088,
%T 10408466809330388,52893775837362904704
%N Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than 4-1 elements moved to themselves.
%C Column 4 of A271684.
%e Some solutions for n=4
%e .....0........6........0........0........0........0........6........0
%e ....0.6......2.3......5.0......6.3......5.3......0.0......2.5......4.6
%e ...5.2.5....0.4.5....5.1.6....5.3.1....4.2.6....5.6.6....6.1.5....5.1.3
%e ..2.2.3.0..0.2.3.0..4.2.0.1..4.4.2.0..4.3.0.1..2.2.3.1..0.1.2.0..2.0.4.3
%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
| 