|
%I #7 May 04 2021 15:45:59
%S 1,5,22,532,19448,2249488,556148184,357523207792,546128923805904,
%T 2069530459322561760,19127220928721943633120
%N Number of ways to move elements of an n X n X n triangular array to themselves or a neighbor, with no more than 2-1 elements moved to themselves.
%C Column 2 of A271684.
%e Some solutions for n=4
%e .....5........0........5........6........0........5........5........5
%e ....4.1......4.6......5.1......2.5......4.3......2.5......2.5......4.1
%e ...5.3.3....5.1.6....4.6.1....2.4.6....5.5.3....6.3.1....6.2.5....6.0.5
%e ..4.4.4.1..2.2.3.3..4.3.4.1..0.1.3.3..2.4.4.1..0.4.4.1..2.3.2.0..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. A271684.
%K nonn
%O 1,2
%A _R. H. Hardin_, Apr 12 2016
| 