Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Dec 26 2023 18:09:06
%S 3,8,8,19,39,19,35,84,84,35,64,129,115,129,64,110,178,242,242,178,110,
%T 185,338,690,968,690,338,185,322,722,1922,3698,3698,1922,722,322,599,
%U 1568,5460,14112,19434,14112,5460,1568,599,1084,3362,15488,54450,99458
%N T(n,k) = Number of n X k 1..3 arrays with no element with value z exactly a city block distance of z from another element with value z.
%C Table starts
%C ...3....8....19.....35......64......110.......185........322.........599
%C ...8...39....84....129.....178......338.......722.......1568........3362
%C ..19...84...115....242.....690.....1922......5460......15488.......43792
%C ..35..129...242....968....3698....14112.....54450.....208658......798848
%C ..64..178...690...3698...19434....99458....510378....2622050....13507474
%C .110..338..1922..14112...99458...677448...4657352...32224392...222731618
%C .185..722..5460..54450..510378..4657352..43249360..402144800..3725851316
%C .322.1568.15488.208658.2622050.32224392.402144800.5008603698.62277674888
%H R. H. Hardin, <a href="/A209374/b209374.txt">Table of n, a(n) for n = 1..364</a>
%e Some solutions for n=5, k=3
%e ..3..2..3....2..3..1....3..2..2....2..2..1....3..1..3....3..2..2....1..2..1
%e ..1..2..1....2..1..3....1..3..1....3..1..3....1..3..2....1..3..1....3..1..3
%e ..3..1..3....1..3..2....2..1..3....1..3..1....3..1..3....3..1..3....1..3..2
%e ..1..3..1....3..1..3....1..3..1....3..2..2....2..2..1....1..3..1....2..1..3
%e ..2..2..3....2..2..1....3..2..3....1..3..1....3..1..3....3..1..2....2..3..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Mar 07 2012