cp's OEIS Frontend

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.

A219741 T(n,k) = Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..1 nXk array.

This page as a plain text file.
%I A219741 #14 Aug 25 2013 17:59:56
%S A219741 1,2,2,4,6,4,7,13,13,7,12,28,42,28,12,21,60,126,126,60,21,37,129,387,
%T A219741 524,387,129,37,65,277,1180,2229,2229,1180,277,65,114,595,3606,9425,
%U A219741 13322,9425,3606,595,114,200,1278,11012,39905,78661,78661,39905,11012,1278,200
%N A219741 T(n,k) = Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..1 nXk array.
%C A219741 Table starts
%C A219741 ...1.....2......4........7.........12...........21.............37
%C A219741 ...2.....6.....13.......28.........60..........129............277
%C A219741 ...4....13.....42......126........387.........1180...........3606
%C A219741 ...7....28....126......524.......2229.........9425..........39905
%C A219741 ..12....60....387.....2229......13322........78661.........466288
%C A219741 ..21...129...1180.....9425......78661.......647252........5350080
%C A219741 ..37...277...3606....39905.....466288......5350080.......61758332
%C A219741 ..65...595..11012...168925....2760690.....44159095......711479843
%C A219741 .114..1278..33636...715072...16350693....364647622.....8201909757
%C A219741 .200..2745.102733..3027049...96830726...3010723330....94531063074
%C A219741 .351..5896.313781.12813931..573456240..24858935864..1089590912023
%C A219741 .616.12664.958384.54243509.3396136349.205253857220.12558669019786
%H A219741 R. H. Hardin, <a href="/A219741/b219741.txt">Table of n, a(n) for n = 1..337</a>
%F A219741 Zeilberger's Maple code (see links in A228285) would presumably give recurrences for the columns of this array. - _N. J. A. Sloane_, Aug 22 2013
%e A219741 Some solutions for n=3 k=4
%e A219741 ..0..0..0..0....1..0..0..1....0..0..1..0....0..0..1..0....0..0..0..1
%e A219741 ..0..1..0..0....0..0..0..0....1..0..0..0....0..0..0..0....0..1..0..0
%e A219741 ..0..0..0..0....0..1..0..1....0..0..0..1....1..0..0..1....0..0..0..0
%Y A219741 Column 1 is A005251(n+2).
%Y A219741 Column 2 is A002478(n+1).
%Y A219741 Column 3 is A105262(n+1) for n>1.
%Y A219741 Main diagonal is A066864.
%Y A219741 See A226444 for an array with very similar entries. - _N. J. A. Sloane_, Aug 22 2013
%K A219741 nonn,tabl
%O A219741 1,2
%A A219741 _R. H. Hardin_, Nov 26 2012