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!)
A263588 Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 filled by rows with each element moved a city block distance of 1 or 2, and rows and columns in increasing lexicographic order. 1

%I

%S 4,134,1992,27650,343431,3777963,38762619,377102980,3519017214,

%T 31782863567,279755669078,2411988669554,20450270031430,

%U 171047927517261,1414934370045463,11599885089631470,94407727875281839,763843712572305864

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

%C Row 2 of A263586.

%H R. H. Hardin, <a href="/A263588/b263588.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=4

%e ..2..5..6..9.14....1..2..3..4.14....1..2..3..8..9....1..5..6..7..9

%e ..7..0..1.12..8....6..0..5..9..7....7..0.11..6..4...10..0..8..2.13

%e .11.10.13..3..4...11.12.10..8.13...12..5.10.14.13...11.12.14..3..4

%Y Cf. A263586.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 22 2015

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 29 18:13 EST 2022. Contains 358431 sequences. (Running on oeis4.)