|
%I #7 Nov 10 2015 12:31:58
%S 6,36,158,614,2596,11045,47252,200690,856618,3643558,15489384,
%T 65863683,280302564,1192057233,5068539465,21551848324,91660701076,
%U 389792005662,1657541261871,7048510785986,29974349818876,127465944902477
%N Number of (n+2)X(1+2) arrays of permutations of 0..n*3+5 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.
%C Column 1 of A263955.
%H R. H. Hardin, <a href="/A263952/b263952.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4
%e ..0..1..2....0..1..7....0..1..2....0..1..3....0..1..7....0..1..3....0..1..7
%e ..3..4.10....2..4.10....3..4..6....2..4..6....3..4..6....2..4.10....2..4..6
%e ..5.12..9....5.14.13....5..7..9....5..7..8....5..2..8....5.12..9....5.14..3
%e ..8.15..6....8..3.11....8.17.12....9.10.11....9.10.12....8.15..6....8.17.16
%e .11.13..7...12..6..9...11.13.14...12.13.15...11.13.14...11.13..7...12.13..9
%e .14.16.17...15.16.17...15.16.10...14.16.17...15.16.17...14.16.17...15.11.10
%Y Cf. A263955.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 30 2015
| 