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 A219740 #8 Jul 23 2025 00:39:23 %S A219740 37,277,3606,39905,466288,5350080,61758332,711479843,8201909757, %T A219740 94531063074,1089590912023,12558669019786,144752526242487, %U A219740 1668430514943073,19230483410164823,221652312986931867 %N A219740 Unmatched value maps: number of nX7 binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..1 nX7 array. %C A219740 Column 7 of A219741 %H A219740 R. H. Hardin, <a href="/A219740/b219740.txt">Table of n, a(n) for n = 1..43</a> %F A219740 Zeilberger's Maple code (see links in A228285) would give a recurrence for this sequence. - N. J. A. Sloane, Aug 22 2013 %e A219740 Some solutions for n=3 %e A219740 ..0..0..1..0..0..0..1....1..0..0..0..0..0..1....0..0..1..0..0..1..0 %e A219740 ..0..0..0..0..0..0..0....0..1..0..0..1..0..0....0..0..0..0..0..0..0 %e A219740 ..1..0..1..0..0..0..1....0..0..0..0..0..1..0....0..1..0..1..0..0..0 %K A219740 nonn %O A219740 1,1 %A A219740 _R. H. Hardin_ Nov 26 2012