|
%I #3 Apr 15 2016 18:46:28
%S 1,3,22,408,18860,1996822,484756640,264090710890,318643448832078,
%T 849130639354784618
%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 6-1 elements moved to themselves.
%C Column 6 of A271852.
%e Some solutions for n=4
%e .....0........5........6........5........0........6........0........6
%e ....0.0......6.1......2.6......6.1......0.5......2.3......5.3......2.5
%e ...4.4.5....5.6.1....0.1.3....6.4.1....5.3.1....0.4.6....4.6.1....2.5.0
%e ..2.3.3.0..4.1.4.1..0.0.0.0..2.3.0.0..4.4.2.0..0.0.1.3..0.0.4.1..2.3.0.0
%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
| 