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 A266573 #6 Aug 12 2016 06:53:59 %S A266573 2,5,15,109,574,2840,13767,71646,390862,2170370,11989812,66094738, %T A266573 366119221,2044786962,11503587136,65003352026,368281990242, %U A266573 2091514533360,11909843102866,68009104297282,389348569168108,2233795881384252 %N A266573 Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its northwest or southwest neighbor modulo 3 and the upper left element equal to 0. %C A266573 Row 3 of A266572. %H A266573 R. H. Hardin, <a href="/A266573/b266573.txt">Table of n, a(n) for n = 1..73</a> %e A266573 Some solutions for n=6 %e A266573 ..0..1..1..0..0..1....0..2..0..1..1..0....0..2..2..0..1..2....0..1..0..0..1..1 %e A266573 ..2..2..0..1..2..0....2..0..1..2..0..1....2..0..1..2..0..1....2..0..0..2..2..0 %e A266573 ..2..1..2..0..1..2....0..1..2..1..2..2....1..1..0..1..2..0....1..1..2..2..1..2 %Y A266573 Cf. A266572. %K A266573 nonn %O A266573 1,1 %A A266573 _R. H. Hardin_, Jan 01 2016