This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A209374 #7 Dec 26 2023 18:09:06 %S A209374 3,8,8,19,39,19,35,84,84,35,64,129,115,129,64,110,178,242,242,178,110, %T A209374 185,338,690,968,690,338,185,322,722,1922,3698,3698,1922,722,322,599, %U A209374 1568,5460,14112,19434,14112,5460,1568,599,1084,3362,15488,54450,99458 %N A209374 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 A209374 Table starts %C A209374 ...3....8....19.....35......64......110.......185........322.........599 %C A209374 ...8...39....84....129.....178......338.......722.......1568........3362 %C A209374 ..19...84...115....242.....690.....1922......5460......15488.......43792 %C A209374 ..35..129...242....968....3698....14112.....54450.....208658......798848 %C A209374 ..64..178...690...3698...19434....99458....510378....2622050....13507474 %C A209374 .110..338..1922..14112...99458...677448...4657352...32224392...222731618 %C A209374 .185..722..5460..54450..510378..4657352..43249360..402144800..3725851316 %C A209374 .322.1568.15488.208658.2622050.32224392.402144800.5008603698.62277674888 %H A209374 R. H. Hardin, <a href="/A209374/b209374.txt">Table of n, a(n) for n = 1..364</a> %e A209374 Some solutions for n=5, k=3 %e A209374 ..3..2..3....2..3..1....3..2..2....2..2..1....3..1..3....3..2..2....1..2..1 %e A209374 ..1..2..1....2..1..3....1..3..1....3..1..3....1..3..2....1..3..1....3..1..3 %e A209374 ..3..1..3....1..3..2....2..1..3....1..3..1....3..1..3....3..1..3....1..3..2 %e A209374 ..1..3..1....3..1..3....1..3..1....3..2..2....2..2..1....1..3..1....2..1..3 %e A209374 ..2..2..3....2..2..1....3..2..3....1..3..1....3..1..3....3..1..2....2..3..1 %K A209374 nonn,tabl %O A209374 1,1 %A A209374 _R. H. Hardin_, Mar 07 2012