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 A196332 #7 Jun 02 2025 04:22:39 %S A196332 4,8,7,50,111,259,744,1840,4761,12491,33073,86147,225519,592444, %T A196332 1548876,4064416,10672675,27999791,73482986,192857345,506140823, %U A196332 1328448433,3487163834,9153779129,24028409740,63075279907,165574433166,434640853456 %N A196332 Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,0,3,1,2 for x=0,1,2,3,4. %C A196332 Every 0 is next to 0 4's, every 1 is next to 1 0's, every 2 is next to 2 3's, every 3 is next to 3 1's, every 4 is next to 4 2's %C A196332 Column 3 of A196337 %H A196332 R. H. Hardin, <a href="/A196332/b196332.txt">Table of n, a(n) for n = 1..200</a> %F A196332 Empirical: a(n) = 3*a(n-1) -a(n-3) -5*a(n-4) +6*a(n-5) +6*a(n-6) -22*a(n-7) -71*a(n-8) +6*a(n-9) +95*a(n-10) +3*a(n-11) +139*a(n-12) -20*a(n-13) -45*a(n-14) +44*a(n-15) -6*a(n-16) -14*a(n-17) %e A196332 Some solutions for n=4 %e A196332 ..1..0..1....1..0..1....0..0..0....1..0..1....0..0..1....1..1..1....1..1..0 %e A196332 ..3..1..3....1..0..1....1..3..1....3..1..1....1..1..1....0..0..0....0..1..1 %e A196332 ..1..1..1....1..0..1....1..1..3....1..3..0....1..3..0....0..0..0....1..1..3 %e A196332 ..0..0..0....1..0..1....0..0..1....0..1..1....0..1..1....0..0..0....1..0..1 %K A196332 nonn %O A196332 1,1 %A A196332 _R. H. Hardin_ Oct 01 2011