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 A265195 #5 Aug 12 2016 06:53:58 %S A265195 1,329,76035,20957398,6394366422,2057050979371,693618769648379, %T A265195 241887129322728625 %N A265195 Number of 5Xn arrays containing n copies of 0..5-1 with no equal horizontal or antidiagonal neighbors and new values introduced sequentially from 0. %C A265195 Row 5 of A265192. %e A265195 Some solutions for n=3 %e A265195 ..0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2 %e A265195 ..2..0..3....3..0..1....0..1..3....0..3..0....3..4..0....2..3..2....3..1..4 %e A265195 ..1..4..0....3..4..3....2..4..1....1..3..4....1..3..2....1..4..3....3..0..3 %e A265195 ..2..4..3....2..1..4....2..4..3....4..2..4....4..1..2....0..4..0....1..4..0 %e A265195 ..3..4..1....4..2..0....3..4..0....3..2..1....4..0..3....3..4..1....2..4..2 %Y A265195 Cf. A265192. %K A265195 nonn %O A265195 1,2 %A A265195 _R. H. Hardin_, Dec 04 2015