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 A219423 #7 Nov 20 2014 19:38:08 %S A219423 1,21,93,453,2121,9926,46776,220655,1041073,4909754,23155430, %T A219423 109215035,515130861,2429644852,11459531527,54049709552,254929619681, %U A219423 1202393496717,5671171946685,26748483522662,126161124832462,595047865009759 %N A219423 Unchanging value maps: number of 3 X n binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 3 X n array. %C A219423 Row 3 of A219421. %H A219423 R. H. Hardin, <a href="/A219423/b219423.txt">Table of n, a(n) for n = 1..94</a> %F A219423 Empirical: a(n) = 4*a(n-1) +a(n-2) +7*a(n-3) +36*a(n-4) -62*a(n-5) -78*a(n-6) +88*a(n-7) -121*a(n-8) -110*a(n-9) +325*a(n-10) -31*a(n-11) -175*a(n-12) +320*a(n-13) -17*a(n-14) -193*a(n-15) +107*a(n-16) -108*a(n-17) +7*a(n-18) +a(n-19) -46*a(n-20) +22*a(n-21) +10*a(n-22) +6*a(n-23) +8*a(n-24) for n>26. %e A219423 Some solutions for n=3: %e A219423 ..1..0..1....1..0..0....0..0..1....1..1..1....1..1..1....0..0..0....0..0..0 %e A219423 ..0..0..0....0..1..1....1..0..1....1..0..1....1..1..0....1..0..0....0..0..1 %e A219423 ..1..0..0....1..1..1....0..0..0....0..0..1....0..0..1....0..0..0....0..0..1 %Y A219423 Cf. A219421. %K A219423 nonn %O A219423 1,2 %A A219423 _R. H. Hardin_, Nov 19 2012