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 A265374 #6 Aug 12 2016 06:53:58 %S A265374 1,10,32,236,1238,7968,49214,324152,2143190,14504394,99426578, %T A265374 689852636,4833447174,34171252034,243350167280,1744518978956, %U A265374 12578806997916,91164415152504,663757426934364,4852711337116032,35610643603759148 %N A265374 Number of 4Xn arrays containing n copies of 0..4-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0. %C A265374 Row 4 of A265373. %H A265374 R. H. Hardin, <a href="/A265374/b265374.txt">Table of n, a(n) for n = 1..41</a> %e A265374 Some solutions for n=4 %e A265374 ..0..1..0..2....0..1..2..1....0..1..2..3....0..1..2..0....0..1..2..0 %e A265374 ..3..2..1..3....2..0..3..2....2..3..0..2....2..3..1..3....2..3..1..3 %e A265374 ..1..0..2..0....3..2..1..3....1..2..3..1....0..2..0..2....0..2..0..2 %e A265374 ..2..3..1..3....0..3..0..1....0..1..0..3....3..1..3..1....1..3..1..3 %Y A265374 Cf. A265373. %K A265374 nonn %O A265374 1,2 %A A265374 _R. H. Hardin_, Dec 07 2015