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 A208434 #7 Jun 02 2025 07:45:06 %S A208434 1,2,2,5,14,5,14,54,54,14,41,216,129,216,41,122,864,339,339,864,122, %T A208434 365,3456,1123,1292,1123,3456,365,1094,13824,4155,6416,6416,4155, %U A208434 13824,1094,3281,55296,15273,32813,50507,32813,15273,55296,3281,9842,221184,55715 %N A208434 T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors). %C A208434 Table starts %C A208434 ....1.....2.....5.....14.......41.......122........365.........1094 %C A208434 ....2....14....54....216......864......3456......13824........55296 %C A208434 ....5....54...129....339.....1123......4155......15273........55715 %C A208434 ...14...216...339...1292.....6416.....32813.....169899.......885540 %C A208434 ...41...864..1123...6416....50507....365195....2623167.....19281232 %C A208434 ..122..3456..4155..32813...365195...3673572...36422648....371453021 %C A208434 ..365.13824.15273.169899..2623167..36422648..509698666...7308976236 %C A208434 .1094.55296.55715.885540.19281232.371453021.7308976236.148054300100 %H A208434 R. H. Hardin, <a href="/A208434/b208434.txt">Table of n, a(n) for n = 1..220</a> %e A208434 Some solutions for n=4 k=3 %e A208434 ..0..0..0....0..1..0....0..1..0....0..0..0....0..1..2....0..0..1....0..0..0 %e A208434 ..1..0..2....1..1..1....2..1..2....1..1..1....1..2..1....2..0..1....1..1..2 %e A208434 ..1..1..2....2..1..2....0..1..0....2..1..2....0..1..0....2..2..1....1..2..2 %e A208434 ..1..0..2....0..2..0....2..1..2....0..2..0....1..0..1....2..0..1....0..0..2 %Y A208434 Column 1 is A007051(n-1) %K A208434 nonn,tabl %O A208434 1,2 %A A208434 _R. H. Hardin_ Feb 26 2012