login
This site is supported by donations to The OEIS 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
118, 5900, 246718, 11302184, 567198796, 28510063298, 1418147981596, 70894152016200, 3555582301683315, 177946439326846213, 8909872006087954871 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 3 of A263955.

LINKS

Table of n, a(n) for n=1..11.

EXAMPLE

Some solutions for n=2

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

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

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

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

CROSSREFS

Cf. A263955.

Sequence in context: A220715 A230917 A230248 * A231283 A165156 A062500

Adjacent sequences:  A263951 A263952 A263953 * A263955 A263956 A263957

KEYWORD

nonn

AUTHOR

R. H. Hardin, Oct 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 10:03 EDT 2019. Contains 324152 sequences. (Running on oeis4.)