|
%I #6 May 11 2023 12:49:32
%S 0,1,1,1,2,1,3,16,16,3,3,152,488,152,3,13,1449,22416,22416,1449,13,16,
%T 11655,978956,4488765,978956,11655,16,42,89469,32651213,816320455,
%U 816320455,32651213,89469,42,74,705803,1094498759
%N T(n,k) = Number of n X k 1..4 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.........3.......13.........16.....42.74
%C ..1.....2.......16.......152......1449....11655......89469.705803
%C ..1....16......488.....22416....978956.32651213.1094498759
%C ..3...152....22416...4488765.816320455
%C ..3..1449...978956.816320455
%C .13.11655.32651213
%C .16.89469
%C .42
%e Some solutions for n=4, k=3
%e ..2..3..3....3..3..3....3..2..4....2..4..2....1..3..2....3..3..2....2..1..1
%e ..1..2..4....3..3..3....3..1..1....4..1..1....1..2..3....3..3..2....2..2..1
%e ..1..3..3....3..1..1....4..2..1....1..1..2....3..2..3....2..2..2....2..1..1
%e ..4..3..3....3..1..1....3..3..2....1..2..4....3..2..2....3..3..3....2..2..2
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_, Mar 07 2012
|
