|
%I #5 Mar 31 2012 12:37:28
%S 2,13,115,1243,11598,110995,1053489,9540747,85820627,770618921,
%T 6892469296,61437526441,548885702669,4911226981619,43974803859339,
%U 394217661482450,3536470866223484,31727866780706631,284622463808862333
%N Number of nX2 0..3 arrays with every element value z a city block distance of exactly z from another element value z
%C Column 2 of A209178
%H R. H. Hardin, <a href="/A209174/b209174.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=5
%e ..0..2....2..2....2..0....1..1....0..0....0..2....3..3....1..1....2..3....1..1
%e ..0..0....3..0....3..2....0..2....2..3....3..3....0..0....3..3....2..2....1..0
%e ..0..2....2..2....2..0....2..3....0..2....3..2....3..1....1..1....0..3....2..0
%e ..2..1....0..0....1..1....1..1....3..2....3..0....3..1....3..1....2..3....0..2
%e ..0..1....3..0....3..0....3..0....2..3....3..3....0..1....3..0....3..0....1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 05 2012
| 