|
%I #7 Oct 01 2021 17:38:56
%S 0,1,1,1,2,1,3,16,16,3,2,122,409,122,2,8,690,10796,10796,690,8,10,
%T 4098,207438,804545,207438,4098,10,21,24301,3706083,42033202,42033202,
%U 3706083,24301,21,35,131984,63071815,2043431891,5995346079,2043431891,63071815
%N T(n,k) = Number of n X k 1..3 arrays with every element value z a city block distance of exactly z from another element value z.
%C Table starts
%C ..0......1..........1...........3............2............8..........10
%C ..1......2.........16.........122..........690.........4098.......24301
%C ..1.....16........409.......10796.......207438......3706083....63071815
%C ..3....122......10796......804545.....42033202...2043431891.95757163046
%C ..2....690.....207438....42033202...5995346079.786021209045
%C ..8...4098....3706083..2043431891.786021209045
%C .10..24301...63071815.95757163046
%C .21.131984.1032759720
%H R. H. Hardin, <a href="/A209365/b209365.txt">Table of n, a(n) for n = 1..59</a>
%e Some solutions for n=5, k=2
%e ..2..3....1..3....2..3....3..3....1..2....1..3....2..2....2..3....3..2....3..3
%e ..2..2....1..2....3..2....2..2....1..1....1..3....1..1....2..2....3..3....3..3
%e ..3..2....2..2....3..2....3..2....3..2....3..3....2..2....3..2....2..2....3..3
%e ..1..1....2..3....2..2....3..2....1..1....1..1....1..1....2..1....3..3....1..3
%e ..1..2....2..2....3..2....2..2....1..3....3..3....1..2....1..1....2..2....1..3
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_ Mar 06 2012
|
