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 A207550 #9 Mar 24 2023 09:52:21 %S A207550 3,9,9,26,81,26,75,676,676,75,216,5625,14974,5625,216,622,46656, %T A207550 327518,327899,46656,622,1791,386884,7169168,18584111,7104784,386884, %U A207550 1791,5157,3207681,156957792,1058580304,1033847229,153718531,3207681,5157,14849 %N A207550 T(n,k) = Number of n X k 0..2 arrays avoiding the pattern z-2 z-1 z in any row, column, nw-to-se diagonal or ne-to-sw antidiagonal. %C A207550 Table starts %C A207550 ....3........9..........26..............75................216 %C A207550 ....9.......81.........676............5625..............46656 %C A207550 ...26......676.......14974..........327518............7169168 %C A207550 ...75.....5625......327899........18584111.........1058580304 %C A207550 ..216....46656.....7104784......1033847229.......151596413811 %C A207550 ..622...386884...153718531.....57282563287.....21553876840265 %C A207550 .1791..3207681..3323115736...3168082336959...3054158366460488 %C A207550 .5157.26594649.71828785449.175129179194410.432330439527473859 %H A207550 R. H. Hardin, <a href="/A207550/b207550.txt">Table of n, a(n) for n = 1..127</a> %e A207550 Some solutions for n=4, k=3 %e A207550 ..2..2..1....0..0..0....2..0..2....1..0..1....2..1..2....1..2..2....2..0..1 %e A207550 ..2..0..0....2..0..2....1..1..1....2..0..2....1..2..1....0..0..1....0..0..2 %e A207550 ..2..0..0....2..0..1....1..0..0....0..2..2....0..2..1....1..2..0....1..1..2 %e A207550 ..2..2..2....0..0..0....1..2..2....2..0..2....1..1..2....1..2..1....0..0..1 %Y A207550 Column 1 is A076264. %Y A207550 Column 2 is A206694. %Y A207550 Row 1 is A076264. %Y A207550 Row 2 is A206694. %K A207550 nonn,tabl %O A207550 1,1 %A A207550 _R. H. Hardin_, Feb 18 2012