A220574
Equals one maps: number of n X 3 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 n X 3 array.
Original entry on oeis.org
4, 21, 91, 375, 1487, 5835, 22775, 88683, 344975, 1341395, 5214791, 20271307, 78797247, 306290211, 1190562423, 4627750267, 17988173039, 69920406547, 271782019879, 1056422029931, 4106332901663, 15961395217283, 62042250575063
Offset: 1
Some solutions for n=3:
..1..1..1....0..1..0....1..0..1....0..1..1....0..0..1....0..1..0....0..0..1
..1..0..1....0..0..0....1..0..0....1..0..1....1..1..0....0..0..0....1..0..0
..1..1..1....0..0..0....0..1..0....1..0..0....0..0..1....0..0..1....0..1..0
A220575
Equals one maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 nX4 array.
Original entry on oeis.org
8, 115, 1441, 17505, 205323, 2352642, 26616961, 299065708, 3347252663, 37378135504, 416811197294, 4643851898712, 51709572437898, 575575826236700, 6405129188993734, 71266042324237205, 792848605905100847
Offset: 1
Some solutions for n=3
..0..1..0..1....1..0..1..0....1..1..1..1....1..0..1..0....1..0..1..1
..0..1..1..0....1..1..0..1....1..0..0..1....0..0..0..1....1..0..0..1
..1..0..1..0....0..1..0..1....0..1..0..1....1..1..0..0....1..1..0..1
A220576
Equals one maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 nX5 array.
Original entry on oeis.org
16, 371, 8334, 165130, 3162375, 59690533, 1120269376, 20961430054, 391477041024, 7301113014734, 136014086356403, 2531419892514045, 47074407789101798, 874763025888567980, 16244954731049984109, 301509938118179385606
Offset: 1
Some solutions for n=3
..0..0..1..0..0....0..0..0..1..0....0..1..1..1..0....0..0..0..1..1
..1..0..0..0..0....0..1..0..1..0....1..0..1..0..1....0..0..0..0..0
..1..1..1..0..0....0..1..0..1..1....1..0..1..0..1....1..0..1..1..0
A220577
Equals one maps: number of n X 6 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 n X 6 array.
Original entry on oeis.org
32, 1504, 64497, 2652007, 106841503, 4239598056, 166807007000, 6529331189875, 254699982141104, 9910761556318406, 384907165469846911, 14926115051516165111, 578101882311226268847, 22367892146863380815542
Offset: 1
Some solutions for n=3
..0..0..1..0..0..0....0..0..1..0..1..0....0..1..1..0..1..1....1..0..1..0..1..1
..1..1..0..1..1..1....0..1..1..0..1..0....1..0..1..0..1..0....0..1..0..0..0..0
..0..1..0..0..0..1....0..1..1..1..0..0....0..1..0..1..0..0....0..0..0..0..1..0
A220580
Equals one maps: number of 2Xn binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 2Xn array.
Original entry on oeis.org
1, 8, 21, 115, 371, 1504, 5240, 19904, 71787, 266591, 973703, 3590009, 13161398, 48409054, 177699822, 653013280, 2398088376, 8809799868, 32356803616, 118855121770, 436550962678, 1603501078153, 5889674104016, 21633105877502
Offset: 1
Some solutions for n=3
..0..0..0....1..0..1....1..1..0....1..0..0....0..1..1....0..0..1....0..0..1
..0..0..0....1..1..1....0..1..1....0..0..0....1..0..1....1..0..0....1..0..1
A220581
Equals one maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 3Xn array.
Original entry on oeis.org
1, 32, 91, 1441, 8334, 64497, 436288, 3036588, 21023792, 146254012, 1011489196, 7016643627, 48603225482, 336693889957, 2332461879768, 16156948253940, 111913294295697, 775187951935208, 5369332881497134, 37190288381188178
Offset: 1
Some solutions for n=3
..0..0..1....1..1..1....0..0..1....1..0..0....0..1..1....1..0..0....0..0..0
..1..0..1....1..0..0....1..0..1....0..1..0....1..1..0....0..0..1....0..0..1
..1..0..0....0..0..1....1..0..1....0..0..0....0..1..1....1..0..1....1..1..0
A220573
Equals one maps: number of n X n binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 n X n array.
Original entry on oeis.org
1, 8, 91, 17505, 3162375, 4239598056, 12835487766480
Offset: 1
Some solutions for n=3
..0..0..1....0..1..0....0..0..1....1..1..1....1..0..0....0..1..1....1..1..1
..1..1..1....0..0..0....1..1..0....1..0..1....0..1..1....1..1..1....1..0..0
..1..0..1....0..1..0....0..1..0....1..1..1....1..0..0....1..0..1....0..1..1
A220578
Equals one maps: number of nX7 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 nX7 array.
Original entry on oeis.org
64, 5240, 436288, 33180533, 2449921734, 178051989526, 12835487766480
Offset: 1
Some solutions for n=3
..0..0..0..0..0..1..0....0..0..0..1..0..0..1....0..0..1..0..0..1..0
..0..1..0..0..1..0..1....0..0..1..1..0..1..1....0..1..0..1..0..0..1
..1..1..1..0..1..0..0....1..1..1..0..1..0..0....1..0..1..0..0..0..0
A220582
Equals one maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 4Xn array.
Original entry on oeis.org
1, 128, 375, 17505, 165130, 2652007, 33180533, 450926562, 5905274893, 77665021467
Offset: 1
Some solutions for n=3
..1..0..1....1..1..0....1..0..1....1..0..1....1..0..1....1..1..0....1..1..1
..1..0..0....0..0..1....1..0..0....1..1..1....1..1..1....0..0..1....1..0..0
..0..1..1....1..1..0....0..0..0....1..0..1....1..1..0....1..1..1....0..0..1
..1..1..0....0..1..0....0..0..1....1..1..1....0..1..1....1..0..1....1..0..1
A220583
Equals one maps: number of 5Xn binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 5Xn array.
Original entry on oeis.org
1, 512, 1487, 205323, 3162375, 106841503, 2449921734, 65126683335
Offset: 1
Some solutions for n=3
..1..0..0....1..0..1....1..0..1....1..0..1....1..0..1....0..0..0....0..0..0
..0..0..1....1..1..1....1..1..0....1..0..0....1..1..0....0..0..0....0..0..0
..1..0..0....1..0..0....0..0..1....0..1..0....0..0..0....0..0..1....0..0..0
..0..0..1....0..0..1....1..0..1....0..0..1....0..1..1....1..0..0....0..0..0
..1..1..1....1..1..1....1..0..0....1..0..0....1..1..0....0..0..0....0..1..1
Showing 1-10 of 12 results.
Comments