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 A266458 #6 Aug 12 2016 06:53:59 %S A266458 9,3417,2079765,1548940233,1294905380013,1166706600769605, %T A266458 1107835329027759705,1093576003604580530985,1112248727149947766472565, %U A266458 1158391002421511021525838237,1229934205503034925503524320745 %N A266458 Number of 5Xn arrays containing n copies of 0..5-1 with no element 1 greater than its north neighbor modulo 5 and the upper left element equal to 0. %C A266458 Row 5 of A266455. %H A266458 R. H. Hardin, <a href="/A266458/b266458.txt">Table of n, a(n) for n = 1..15</a> %e A266458 Some solutions for n=2 %e A266458 ..0..2....0..1....0..3....0..1....0..2....0..2....0..0....0..4....0..4....0..0 %e A266458 ..4..0....2..4....4..3....2..0....3..1....4..0....4..2....3..1....0..3....3..2 %e A266458 ..3..4....4..2....2..1....4..4....2..4....2..3....4..1....2..4....2..1....3..4 %e A266458 ..2..1....3..1....1..4....3..3....1..4....1..1....3..3....2..1....2..1....1..2 %e A266458 ..1..3....3..0....0..2....1..2....0..3....4..3....1..2....0..3....4..3....1..4 %Y A266458 Cf. A266455. %K A266458 nonn %O A266458 1,1 %A A266458 _R. H. Hardin_, Dec 29 2015