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

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

%I

%S 7,35,208,1198,7022,41035,240237,1406038,8230727,48180019,282036139,

%T 1650978414,9664491503,56573952014,331172398977,1938615771254,

%U 11348262181134,66430417127424,388870142636120,2276366675982209

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

%C Column 2 of A263519.

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

%F Empirical: a(n) = 7*a(n-1) -a(n-2) -39*a(n-3) +24*a(n-4) +57*a(n-5) -33*a(n-6) -28*a(n-7) +13*a(n-8) +3*a(n-9) -a(n-10)

%e Some solutions for n=4

%e ..0..1..5....0..1..2....0..1..2....0..2..5....0..2..5....0..1..2....0..1..2

%e ..4..3..2....3..4..8....3..4..8....3..1..4....3..1..8....3..4..5....4..3..5

%e ..7..6..8....9..6..5....6..7..5....7..6.11....6..4..7....7..6..8....9..6..7

%e ..9.11.10...10..7.11....9.10.14....9.13..8....9.10.14...10..9.11...10.13..8

%e .12.14.13...13.12.14...12.13.11...12.10.14...13.12.11...12.14.13...12.14.11

%Y Cf. A263519.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 19 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.

Last modified October 26 11:29 EDT 2020. Contains 338027 sequences. (Running on oeis4.)