|
%I #6 Nov 10 2015 12:23:55
%S 8,48,204,770,2687,8559,25383,71498,193691,508996,1306369,3291584,
%T 8173381,20060419,48777993,117717414,282365804,673959638,1602152316,
%U 3796140809,8970338435,21150183227,49777148466,116976012851,274555052038
%N Number of (1+1)X(n+1) arrays of permutations of 0..n*2+1 filled by rows with each element moved a city block distance of 0 1 or 2, and rows and columns in increasing lexicographic order.
%C Row 1 of A263506.
%H R. H. Hardin, <a href="/A263507/b263507.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 6*a(n-1) -12*a(n-2) +9*a(n-3) -4*a(n-4) +2*a(n-5) +10*a(n-6) -12*a(n-7) -a(n-10) +4*a(n-11) -a(n-13)
%e Some solutions for n=4
%e ..0..1..2..4..9....1..2..4..7..8....0..2..4..7..8....0..1..2..8..9
%e ..5..8..3..6..7....5..0..3..6..9....5..1..6..9..3....6..7..5..4..3
%Y Cf. A263506.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 19 2015
|
