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 A241333 #6 Jul 23 2025 11:13:02 %S A241333 187,165924,157912026,151022716125,144410575985227,138095118530911728, %T A241333 132055730959382784981,126280562312797983331007, %U A241333 120757959210267024208723561,115476876363426327956883452444 %N A241333 Number of 6Xn 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 A241333 Row 6 of A241328 %H A241333 R. H. Hardin, <a href="/A241333/b241333.txt">Table of n, a(n) for n = 1..41</a> %e A241333 Some solutions for n=2 %e A241333 ..0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1 %e A241333 ..1..0....2..1....0..2....0..1....0..2....1..2....1..2....0..2....1..2....1..2 %e A241333 ..2..3....0..0....2..0....1..2....0..1....0..1....0..2....2..0....0..2....2..1 %e A241333 ..1..0....0..0....1..2....0..2....0..1....2..1....1..2....3..0....3..0....3..0 %e A241333 ..2..3....0..0....1..0....1..2....1..2....1..0....2..1....3..2....1..2....1..2 %e A241333 ..3..1....1..0....3..1....0..2....0..2....0..3....2..3....1..0....2..0....1..3 %K A241333 nonn %O A241333 1,1 %A A241333 _R. H. Hardin_, Apr 19 2014