login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263386 Number of (n+1)X(2+1) arrays of permutations of 0..n*2-1 with each element moved a city block distance of exactly 2. 1
4, 144, 1600, 17376, 240100, 3187140, 40513225, 522858816, 6789760000, 87813119040, 1135019629129, 14684255469380, 189969931229764, 2457186289234608, 31783955221424704, 411141537375064736 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 2 of A263389.

LINKS

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

EXAMPLE

Some solutions for n=4

..4..5..0....2..3..8....2..5..0....4..3..0....2..3..8....4..3..8....4..5..0

..7.10..1....5..0..7....1..6.11....5..2..1....5..6.11....1..0.11....9..6..1

.12..9..2...12..1.14...12..9.14....8.13..6....0..1.14...12.13..2...10.11..2

..3.14.13...13..4..9....3..4.13....7.12..9...13..4..9....7..6..5....3..8.13

..6.11..8....6.11.10...10..7..8...14.11.10...10..7.12...14..9.10...14..7.12

CROSSREFS

Cf. A263389.

Sequence in context: A273698 A134631 A036511 * A186720 A060870 A268894

Adjacent sequences:  A263383 A263384 A263385 * A263387 A263388 A263389

KEYWORD

nonn

AUTHOR

R. H. Hardin, Oct 16 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 January 20 16:20 EST 2019. Contains 319335 sequences. (Running on oeis4.)