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 A208433 #7 Jun 02 2025 07:45:00 %S A208433 365,13824,15273,169899,2623167,36422648,509698666,7308976236, %T A208433 104548902187,1491128667703,21311956695888,304671374144232, %U A208433 4354902558505404,62240469327888568,889738186413603234 %N A208433 Number of nX7 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 A208433 Column 7 of A208434 %H A208433 R. H. Hardin, <a href="/A208433/b208433.txt">Table of n, a(n) for n = 1..210</a> %e A208433 Some solutions for n=4 %e A208433 ..0..1..0..1..1..1..0....0..0..0..0..1..2..0....0..1..2..0..2..0..2 %e A208433 ..2..0..2..0..1..0..2....2..1..2..1..2..1..2....0..1..1..2..0..1..1 %e A208433 ..0..1..0..2..0..2..0....1..2..1..2..1..2..1....2..1..2..0..2..0..2 %e A208433 ..2..0..2..0..1..0..1....2..1..2..0..2..0..2....0..2..0..2..0..2..0 %K A208433 nonn %O A208433 1,1 %A A208433 _R. H. Hardin_ Feb 26 2012