A263952 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.

6, 36, 158, 614, 2596, 11045, 47252, 200690, 856618, 3643558, 15489384, 65863683, 280302564, 1192057233, 5068539465, 21551848324, 91660701076, 389792005662, 1657541261871, 7048510785986, 29974349818876, 127465944902477

Offset

1,1

Comments

Column 1 of A263955.

Links

R. H. Hardin, Table of n, a(n) for n = 1..210

Example

Some solutions for n=4
..0..1..2....0..1..7....0..1..2....0..1..3....0..1..7....0..1..3....0..1..7
..3..4.10....2..4.10....3..4..6....2..4..6....3..4..6....2..4.10....2..4..6
..5.12..9....5.14.13....5..7..9....5..7..8....5..2..8....5.12..9....5.14..3
..8.15..6....8..3.11....8.17.12....9.10.11....9.10.12....8.15..6....8.17.16
.11.13..7...12..6..9...11.13.14...12.13.15...11.13.14...11.13..7...12.13..9
.14.16.17...15.16.17...15.16.10...14.16.17...15.16.17...14.16.17...15.11.10

Crossrefs

Cf. A263955.

Sequence in context: A055404 A223946 A223919 * A281394 A225380 A371157

Adjacent sequences: A263949 A263950 A263951 * A263953 A263954 A263955

Keyword

nonn

Author

R. H. Hardin, Oct 30 2015

Status

approved