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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263954 Number of (n+2)X(3+2) arrays of permutations of 0..n*5+9 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order. 0

%I

%S 118,5900,246718,11302184,567198796,28510063298,1418147981596,

%T 70894152016200,3555582301683315,177946439326846213,

%U 8909872006087954871

%N Number of (n+2)X(3+2) arrays of permutations of 0..n*5+9 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.

%C Column 3 of A263955.

%e Some solutions for n=2

%e ..0..1..2..3..7....0..1..5..6.13....0..8.11.12.13....0..1..5..6.13

%e ..5.17..4.11..9....2..3.16.11.18....5.17.18..1..9....2.17..4..8.18

%e .10..8.19.13.14...10..8.19..4.14...10..2..3..4.14...10.11.19.16..3

%e .15.16..6.18.12...15..7.17..9.12...15.16..6..7.19...15..7.14..9.12

%Y Cf. A263955.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 30 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 21:07 EST 2021. Contains 349344 sequences. (Running on oeis4.)