The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263705 Number of (n+2)X(2+2) arrays of permutations of 0..n*4+7 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. 1
 475, 18995, 437533, 13341380, 414860767, 13151405753, 409464954596, 13041097884324, 416984172658896, 13411256346548047, 432777590466469475, 14030980958229441618, 456328306237092974195, 14885590516436588260515 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 2 of A263706. LINKS R. H. Hardin, Table of n, a(n) for n = 1..15 EXAMPLE Some solutions for n=2 ..0..1.11.10....0.10..4..3....9..1..2..5....6..8..4.10....0..1..2..5 ..4..5.13..7....2.12..6.14...13..3..6.14....2..3..0.14....4.12..6..7 .14..9..3..2....8.15..1.13....8..0.10.11....1.15.12.13....8.15..3.11 .12..6..8.15....5.11..7..9...12..4..7.15....5.11..7..9...10.13.14..9 CROSSREFS Cf. A263706. Sequence in context: A165463 A252518 A210048 * A048428 A253395 A171077 Adjacent sequences:  A263702 A263703 A263704 * A263706 A263707 A263708 KEYWORD nonn AUTHOR R. H. Hardin, Oct 24 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 28 19:21 EDT 2020. Contains 338064 sequences. (Running on oeis4.)