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 A198182 #7 Jun 02 2025 05:24:02 %S A198182 1,16,77,331,2033,8298,48958,216307,1155412,5522239,28200527, %T A198182 139401115,695721892,3477106364,17307490471,86498278609,430707067503, %U A198182 2150928384789,10722364479972,53497634923663,266813770707004,1330929200315097 %N A198182 Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,2,1,0,0 for x=0,1,2,3,4. %C A198182 Every 0 is next to 0 0's, every 1 is next to 1 2's, every 2 is next to 2 1's, every 3 is next to 3 0's, every 4 is next to 4 0's %C A198182 Column 5 of A198185 %H A198182 R. H. Hardin, <a href="/A198182/b198182.txt">Table of n, a(n) for n = 1..210</a> %e A198182 Some solutions containing all values 0 to 4 for n=4 %e A198182 ..0..3..0..1..2....1..2..1..0..1....0..1..1..2..1....1..2..1..1..0 %e A198182 ..3..0..4..0..1....0..3..0..3..2....1..2..0..3..0....0..3..0..2..1 %e A198182 ..0..3..0..2..1....1..0..4..0..1....1..0..4..0..1....3..0..4..0..1 %e A198182 ..1..2..1..1..0....2..1..0..3..0....2..1..0..1..2....0..3..0..1..2 %K A198182 nonn %O A198182 1,2 %A A198182 _R. H. Hardin_ Oct 21 2011