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 A269338 #5 Aug 12 2016 06:54:17 %S A269338 24,1880,152922,13745475,1301306034,128342085219,13047193985189, %T A269338 1357312565492416,143782288933148993,15453753021813989744 %N A269338 Number of 4Xn arrays containing n copies of 0..4-1 avoiding the pattern equal-up in every row and column. %C A269338 Row 4 of A269336. %e A269338 Some solutions for n=3 %e A269338 ..2..3..0. .2..1..1. .0..3..1. .1..2..3. .2..0..2. .0..1..1. .2..0..3 %e A269338 ..3..2..1. .3..0..0. .2..0..2. .3..2..3. .1..3..1. .2..2..2. .1..3..3 %e A269338 ..3..1..2. .0..1..3. .1..1..0. .2..1..0. .0..3..2. .0..3..3. .0..2..0 %e A269338 ..1..0..0. .3..2..2. .3..2..3. .0..1..0. .1..3..0. .1..3..0. .1..2..1 %Y A269338 Cf. A269336. %K A269338 nonn %O A269338 1,1 %A A269338 _R. H. Hardin_, Feb 24 2016