cp's OEIS Frontend

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.

%I A263513 #6 Nov 10 2015 12:12:24
%S A263513 7,35,208,1198,7022,41035,240237,1406038,8230727,48180019,282036139,
%T A263513 1650978414,9664491503,56573952014,331172398977,1938615771254,
%U A263513 11348262181134,66430417127424,388870142636120,2276366675982209
%N 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.
%C A263513 Column 2 of A263519.
%H A263513 R. H. Hardin, <a href="/A263513/b263513.txt">Table of n, a(n) for n = 1..210</a>
%F A263513 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 A263513 Some solutions for n=4
%e A263513 ..0..1..5....0..1..2....0..1..2....0..2..5....0..2..5....0..1..2....0..1..2
%e A263513 ..4..3..2....3..4..8....3..4..8....3..1..4....3..1..8....3..4..5....4..3..5
%e A263513 ..7..6..8....9..6..5....6..7..5....7..6.11....6..4..7....7..6..8....9..6..7
%e A263513 ..9.11.10...10..7.11....9.10.14....9.13..8....9.10.14...10..9.11...10.13..8
%e A263513 .12.14.13...13.12.14...12.13.11...12.10.14...13.12.11...12.14.13...12.14.11
%Y A263513 Cf. A263519.
%K A263513 nonn
%O A263513 1,1
%A A263513 _R. H. Hardin_, Oct 19 2015