Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #3 Apr 15 2016 18:46:50
%S 1,3,23,426,21010,2422412,656536622,403782014944,553766164923422
%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 7-1 elements moved to themselves.
%C Column 7 of A271852.
%e Some solutions for n=4
%e .....0........6........5........5........6........6........5........0
%e ....4.6......2.3......6.1......4.1......2.6......2.3......6.1......0.0
%e ...2.0.5....0.4.5....6.3.1....6.4.5....2.5.6....4.5.5....0.2.5....6.4.5
%e ..2.3.3.0..0.2.3.0..0.4.4.1..2.3.1.0..2.3.1.3..2.3.4.1..0.0.4.1..2.3.1.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