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 A267024 #5 Aug 12 2016 06:54:00 %S A267024 24,11,45,259,2063,18157,172169,1717333,17555313,184061791,1966919505, %T A267024 21379461151,235731898917,2632460173093 %N A267024 Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo 5 and the upper left element equal to 0. %C A267024 Row 5 of A267019. %e A267024 Some solutions for n=4 %e A267024 ..0..2..4..2....0..2..4..1....0..2..0..2....0..3..1..3....0..3..1..3 %e A267024 ..3..0..2..4....3..0..2..4....3..0..3..1....4..1..4..1....3..1..4..1 %e A267024 ..1..3..0..3....0..3..0..2....0..3..1..3....2..4..2..0....2..4..1..4 %e A267024 ..3..1..4..1....3..1..3..1....4..1..4..2....4..2..0..2....0..2..4..2 %e A267024 ..1..4..2..0....2..4..1..4....1..4..2..4....3..0..3..1....2..0..3..0 %Y A267024 Cf. A267019. %K A267024 nonn %O A267024 1,1 %A A267024 _R. H. Hardin_, Jan 09 2016