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 A219739 #8 Jul 23 2025 00:39:16 %S A219739 21,129,1180,9425,78661,647252,5350080,44159095,364647622,3010723330, %T A219739 24858935864,205253857220,1694729679245,13992960979394, %U A219739 115536377026413,953955009802438,7876568121973188,65034854910941849,536976546612691621 %N A219739 Unmatched value maps: number of nX6 binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..1 nX6 array. %C A219739 Column 6 of A219741 %H A219739 R. H. Hardin, <a href="/A219739/b219739.txt">Table of n, a(n) for n = 1..38</a> %F A219739 Zeilberger's Maple code (see links in A228285) would give a recurrence for this sequence. - _N. J. A. Sloane_, Aug 22 2013 %e A219739 Some solutions for n=3 %e A219739 ..1..0..1..0..1..0....0..0..1..0..0..0....0..0..0..0..0..0....0..0..1..0..0..1 %e A219739 ..0..0..0..0..0..0....1..0..0..1..0..1....0..1..0..0..0..1....0..0..0..0..0..0 %e A219739 ..1..0..0..1..0..0....0..0..0..0..0..0....0..0..0..1..0..0....0..1..0..1..0..1 %K A219739 nonn %O A219739 1,1 %A A219739 _R. H. Hardin_ Nov 26 2012