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 A268425 #3 Feb 04 2016 09:54:59 %S A268425 44,34195,22309009,15615613747,10053286458091,6434348326690233, %T A268425 3993182343091351469,2446591845328690229717 %N A268425 Number of 5Xn 0..3 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order. %C A268425 Row 5 of A268423. %e A268425 Some solutions for n=2 %e A268425 ..0..1....0..1....0..1....0..0....0..0....0..0....0..1....0..1....0..1....0..1 %e A268425 ..2..0....0..0....0..0....1..2....1..2....0..1....2..2....1..0....2..3....1..2 %e A268425 ..1..2....0..2....1..2....1..0....1..0....1..2....2..0....1..0....0..3....2..3 %e A268425 ..1..1....3..1....2..3....3..0....1..0....3..0....3..3....0..1....2..3....3..1 %e A268425 ..3..0....2..0....0..3....0..0....1..2....2..1....2..3....2..0....1..3....2..0 %Y A268425 Cf. A268423. %K A268425 nonn %O A268425 1,1 %A A268425 _R. H. Hardin_, Feb 04 2016