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 A197275 #7 Jun 02 2025 04:49:10 %S A197275 4,14,34,92,317,888,2626,8078,24103,72107,217970,656610,1975147, %T A197275 5955136,17950843,54086244,163025795,491430743,1481229421,4464844849, %U A197275 13458804609,40569450638,122290929298,368632726282,1111201586358,3349591968789 %N A197275 Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,1,1 for x=0,1,2,3,4. %C A197275 Every 0 is next to 0 2's, every 1 is next to 1 0's, every 2 is next to 2 1's, every 3 is next to 3 1's, every 4 is next to 4 1's %C A197275 Column 3 of A197280 %H A197275 R. H. Hardin, <a href="/A197275/b197275.txt">Table of n, a(n) for n = 1..200</a> %F A197275 Empirical: a(n) = 3*a(n-1) +a(n-2) -6*a(n-4) -11*a(n-5) +19*a(n-6) -13*a(n-7) -64*a(n-8) +21*a(n-9) +36*a(n-10) -8*a(n-11) -93*a(n-12) +28*a(n-13) -52*a(n-14) -11*a(n-15) +27*a(n-16) -16*a(n-17) -a(n-18) +3*a(n-19) %e A197275 Some solutions for n=4 %e A197275 ..0..1..2....1..1..2....1..0..0....1..0..1....0..0..1....0..0..1....1..0..0 %e A197275 ..0..1..1....0..0..1....1..0..0....1..1..3....1..1..2....0..0..1....1..0..0 %e A197275 ..1..3..0....0..0..1....1..1..1....0..1..1....3..1..2....0..0..1....1..0..0 %e A197275 ..2..1..0....1..1..2....0..1..2....1..1..0....1..0..1....0..0..1....2..1..1 %K A197275 nonn %O A197275 1,1 %A A197275 _R. H. Hardin_ Oct 12 2011