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 A219418 #7 Jun 06 2014 17:20:37 %S A219418 12,160,2121,28154,372560,4934366,65352789,865523957,11462977378, %T A219418 151815415029,2010639231109,26628853182336,352671832205165, %U A219418 4670776468884680,61859640739887596,819267455394261112 %N A219418 Unchanging value maps: number of n X 5 binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 n X 5 array. %C A219418 Column 5 of A219421. %H A219418 R. H. Hardin, <a href="/A219418/b219418.txt">Table of n, a(n) for n = 1..39</a> %F A219418 Empirical: a(n) = 14*a(n-1) -17*a(n-2) +117*a(n-3) -355*a(n-4) +550*a(n-5) -1954*a(n-6) +1579*a(n-7) -1059*a(n-8) -1065*a(n-9) +1097*a(n-10) +8*a(n-11) -153*a(n-12) +45*a(n-13) -6*a(n-14) for n>15. %e A219418 Some solutions for n=3: %e A219418 ..1..0..0..0..0....0..0..1..0..0....0..0..0..0..0....0..0..1..1..1 %e A219418 ..0..0..0..0..1....1..0..0..1..1....0..0..0..1..0....0..0..1..0..0 %e A219418 ..1..1..0..0..0....0..0..0..0..0....0..0..0..0..1....0..0..0..0..1 %K A219418 nonn %O A219418 1,1 %A A219418 _R. H. Hardin_, Nov 19 2012