|
%I #6 Nov 10 2015 12:36:41
%S 36,606,5900,63788,832934,9289071,99951445,1070561979,11300737242,
%T 115663751102,1170494128201,11772196090023,117664907435464,
%U 1168237449914666,11549482457545769,113905143883265304
%N Number of (2+2)X(n+2) arrays of permutations of 0..n*4+7 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.
%C Row 2 of A263955.
%H R. H. Hardin, <a href="/A263957/b263957.txt">Table of n, a(n) for n = 1..63</a>
%e Some solutions for n=4
%e ..0..1..2..3.15.16....0..1.10.14.15.16....0..1..2..3..4..5....0..1..2..3..4..5
%e ..6..7.12.20.23.11....6..7.21.13..2.11....6.20.12.22.23.11....6..7..8.17.10.15
%e ..8.21.22..4..5.17...12..9..3..4..5.17....8.21.14.15.16.17...12.21.14.11.16..9
%e .18.19..9.13.14.10...18.19.20..8.22.23...18.19..7.13..9.10...18.19.20.13.22.23
%Y Cf. A263955.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 30 2015
| 