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 A196704 #7 Jun 02 2025 04:31:40 %S A196704 12,488,8672,193326,4114365,88057485,1883754015,40313628190, %T A196704 862817869506,18466264182264,395214121573203,8458285032169106, %U A196704 181022745479257594,3874225541604098047,82915675332387910699,1774550041727447332819 %N A196704 Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,1,0,4,2 for x=0,1,2,3,4. %C A196704 Every 0 is next to 0 3's, every 1 is next to 1 1's, every 2 is next to 2 0's, every 3 is next to 3 4's, every 4 is next to 4 2's %C A196704 Column 5 of A196707 %H A196704 R. H. Hardin, <a href="/A196704/b196704.txt">Table of n, a(n) for n = 1..200</a> %e A196704 Some solutions for n=4 %e A196704 ..0..1..0..1..1....0..0..2..1..0....0..0..0..0..2....0..0..0..0..0 %e A196704 ..0..1..0..0..2....1..0..0..1..0....2..2..1..0..0....0..0..2..1..1 %e A196704 ..0..2..0..0..0....1..0..1..0..0....0..0..1..2..1....2..2..1..0..0 %e A196704 ..1..1..0..0..2....0..2..1..0..2....2..0..2..0..1....0..0..1..0..2 %K A196704 nonn %O A196704 1,1 %A A196704 _R. H. Hardin_ Oct 05 2011