A263707 Number of (1+2)X(n+2) arrays of permutations of 0..n*3+5 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order.

49, 475, 3588, 33265, 292865, 2600010, 23355021, 213885703, 1961165204, 18132546551, 168328811813, 1570773196000, 14702977725167, 138124769214915, 1301216210855216, 12291590847436569, 116373737176266317

Offset

1,1

Comments

Row 1 of A263706.

Links

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

Example

Some solutions for n=4
.13.14..6..7..4.16....0.14..6.11..4.16...13..1.10.11.17.16...13.12..6.11..8.16
..2..3..8..9.10.11....2.15..8.17.10..3....2.15..8..9.14..3....2..3..4.17.10.15
.12..0..1.15..5.17...12.13..1..7..5..9...12..0..6..7..5..4....1..0.14..7..5..9

Crossrefs

Cf. A263706.

Sequence in context: A012097 A218594 A263706 * A061621 A337356 A030510

Adjacent sequences: A263704 A263705 A263706 * A263708 A263709 A263710

Keyword

nonn

Author

R. H. Hardin, Oct 24 2015

Status

approved