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 A267023 #6 Aug 12 2016 06:54:00 %S A267023 6,8,21,137,759,4835,31591,216460,1516047,10864196,79437844,590119523, %T A267023 4453596825,34028591249,263304258843,2058154419091,16252842542358, %U A267023 129434331448080,1039407597863960,8405943746368118,68447035142972923 %N A267023 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo 4 and the upper left element equal to 0. %C A267023 Row 4 of A267019. %H A267023 R. H. Hardin, <a href="/A267023/b267023.txt">Table of n, a(n) for n = 1..23</a> %e A267023 Some solutions for n=4 %e A267023 ..0..1..3..1....0..2..0..2....0..2..0..2....0..2..0..2....0..1..3..1 %e A267023 ..2..0..2..0....3..1..3..1....2..0..3..1....3..1..3..1....2..0..2..0 %e A267023 ..1..3..1..3....1..0..2..3....1..3..1..3....1..3..1..3....0..2..1..3 %e A267023 ..0..2..3..2....1..2..0..3....0..1..3..2....0..2..0..2....3..1..3..2 %Y A267023 Cf. A267019. %K A267023 nonn %O A267023 1,1 %A A267023 _R. H. Hardin_, Jan 09 2016