login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209537 Number of n X n array permutations with every element making zero or one right-handed knight moves (out 2, right 1) 0
1, 1, 16, 729, 103680, 92160000, 366400000000, 6638067426640896 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Diagonal of A209543

LINKS

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

EXAMPLE

Some solutions for n=4

..6..8..2..3....6..8..2..3....0..7..2..3....6..7..2..3....0..8..2.10

..4.11..0.14....4..5..0.14...10.12..6..1...10..5..0.14....4.12.13..1

..1..9.10..5....1..9.10.11...14..9..4.11....1.15..4.11...14..9..3.11

.12.13..7.15...12.13..7.15....5.13..8.15...12.13..8..9....5..6..7.15

CROSSREFS

Sequence in context: A221023 A171736 A062206 * A086701 A218297 A339202

Adjacent sequences: A209534 A209535 A209536 * A209538 A209539 A209540

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 10 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 27 00:20 EST 2022. Contains 358362 sequences. (Running on oeis4.)