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 A196853 #7 Jun 02 2025 04:35:07 %S A196853 12,496,8767,199125,4326720,94652804,2069281146,45250654402, %T A196853 989582452566,21641093339471,473258424515226,10349412319177011, %U A196853 226326014259354738,4949414076598335496,108236297594374361032,2366965861351964408167 %N A196853 Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,1,0,2,4 for x=0,1,2,3,4. %C A196853 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 2's, every 4 is next to 4 4's %C A196853 Column 5 of A196856 %H A196853 R. H. Hardin, <a href="/A196853/b196853.txt">Table of n, a(n) for n = 1..200</a> %e A196853 Some solutions for n=4 %e A196853 ..0..0..2..2..0....0..0..0..2..0....0..0..0..2..1....0..0..0..1..0 %e A196853 ..1..0..0..0..0....1..1..2..1..1....0..0..0..0..1....0..1..0..1..2 %e A196853 ..1..2..1..1..0....0..2..0..0..2....2..2..0..0..2....0..1..0..2..0 %e A196853 ..0..0..0..2..0....0..1..1..2..0....0..2..0..0..0....0..0..1..1..0 %K A196853 nonn %O A196853 1,1 %A A196853 _R. H. Hardin_ Oct 06 2011