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 A241323 #7 Jul 23 2025 11:12:01 %S A241323 1,8,85,1030,13011,165924,2121033,27129985,347071157,4440219758, %T A241323 56806066313,726751710350,9297746189765,118951351657555, %U A241323 1521812314158867,19469410910818078,249083253366686135,3186663809907191548 %N A241323 Number of nX2 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order. %C A241323 Column 2 of A241328 %H A241323 R. H. Hardin, <a href="/A241323/b241323.txt">Table of n, a(n) for n = 1..210</a> %F A241323 Empirical: a(n) = 17*a(n-1) -57*a(n-2) +43*a(n-3) -37*a(n-4) +109*a(n-5) -62*a(n-6) -48*a(n-8) +36*a(n-9) for n>10 %e A241323 Some solutions for n=4 %e A241323 ..0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1 %e A241323 ..0..2....2..1....2..2....1..1....2..3....0..2....2..1....2..1....2..1....1..1 %e A241323 ..1..0....1..3....2..2....1..1....3..1....2..3....3..0....0..3....2..1....1..2 %e A241323 ..3..0....1..2....0..2....1..2....2..1....0..2....2..3....0..3....2..3....0..2 %K A241323 nonn %O A241323 1,2 %A A241323 _R. H. Hardin_, Apr 19 2014