A263956 Number of (1+2) X (n+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, 40, 118, 354, 1209, 4334, 14525, 46022, 141006, 427611, 1270118, 3707059, 10650367, 30235396, 84926968, 236340047, 652236286, 1787173735, 4866827711, 13182285189, 35538045627, 95417738007, 255294004187, 680978483881

Offset

1,1

Comments

Row 1 of A263955.

Links

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

R. H. Hardin, Empirical recurrence of order 79

Formula

Empirical recurrence of order 79 (see link above).

Example

Some solutions for n=4
..0..1..2..7.15.16....0..1.13.14.15.16....0..1..2..3..8.16....0..1..2..3.15.16
..6..3..8.17.14.11....2..7..4..5.10..3....6..7..4.17.14.11....6..7..8..9.14.11
.12.13.10..4..5..9...12..9..6.11..8.17...12.13.10.15..5..9...12.13.10..4..5.17

Crossrefs

Cf. A263955.

Sequence in context: A114079 A211065 A002595 * A229638 A210291 A336317

Adjacent sequences: A263953 A263954 A263955 * A263957 A263958 A263959

Keyword

nonn

Author

R. H. Hardin, Oct 30 2015

Status

approved