%I #4 Apr 15 2016 18:47:44
%S 0,1,2,1,2,2,1,2,8,42,1,3,14,124,580,1,3,22,208,2782,31892,1,3,22,304,
%T 6580,168566,3193380,1,3,22,384,11246,471344,21337480,800156720,1,3,
%U 23,408,15536,932092,72638356,6300361544,442390366776,1,3,23,426,18860
%N T(n,k)=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 k-1 elements moved to themselves.
%C Table starts
%C .........0..........1...........1...........1............1.........1.......1
%C .........2..........2...........2...........3............3.........3.......3
%C .........2..........8..........14..........22...........22........22......23
%C ........42........124.........208.........304..........384.......408.....426
%C .......580.......2782........6580.......11246........15536.....18860...21010
%C .....31892.....168566......471344......932092......1473994...1996822.2422412
%C ...3193380...21337480....72638356...170786194....314196428.484756640
%C .800156720.6300361544.25380585434.70031967880.149466458074
%H R. H. Hardin, <a href="/A271852/b271852.txt">Table of n, a(n) for n = 1..76</a>
%e Some solutions for n=4 k=4
%e .....6........5........0........6........5........0........5........0
%e ....2.3......4.1......5.3......2.6......4.1......5.3......4.1......5.0
%e ...6.6.3....6.3.6....5.6.1....2.3.6....5.3.3....6.6.1....6.3.3....6.1.3
%e ..2.3.2.0..0.2.2.3..4.2.4.1..0.2.3.3..4.4.4.1..0.2.2.0..0.4.4.1..0.4.4.1
%e Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7
%K nonn,tabl
%O 1,3
%A _R. H. Hardin_, Apr 15 2016
|