A268802
Number of n X n 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.
Original entry on oeis.org
3, 34, 332, 5848, 195384, 12432856, 1508087180, 348686105792, 154172619407288, 130573457756588328, 212323461305457440492, 663970589813116610557692, 3999438097971983178736358520, 46462227980008803491191644654968
Offset: 1
Some solutions for n=4
..2..2..2..2. .0..0..1..2. .2..1..0..0. .0..1..0..0. .1..2..2..1
..1..1..2..2. .1..2..2..2. .2..0..0..0. .1..0..0..0. .2..2..2..2
..2..2..2..2. .2..2..1..2. .1..0..0..1. .0..0..0..1. .1..2..2..1
..1..2..1..2. .2..2..2..2. .0..0..0..0. .0..0..0..0. .2..1..2..1
A268803
Number of n X 2 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.
Original entry on oeis.org
9, 34, 104, 290, 772, 1972, 4914, 12010, 28922, 68836, 162274, 379524, 881712, 2036734, 4681646, 10714994, 24430816, 55516546, 125777028, 284188780, 640549034, 1440572818, 3233256010, 7243375068, 16199546178, 36172883716
Offset: 1
Some solutions for n=4:
..0..1. .1..2. .1..0. .1..0. .2..2. .1..1. .0..0. .0..2. .0..0. .2..2
..0..1. .2..1. .2..1. .0..1. .1..2. .0..0. .1..2. .1..2. .0..0. .2..2
..0..0. .2..2. .2..2. .2..2. .2..1. .0..0. .2..2. .2..2. .0..0. .1..2
..1..0. .1..2. .2..2. .2..1. .0..0. .1..0. .1..2. .2..1. .0..0. .0..1
A268804
Number of nX3 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.
Original entry on oeis.org
24, 104, 332, 1202, 4158, 14308, 48460, 162722, 541744, 1791504, 5889586, 19264864, 62738690, 203528858, 658003018, 2120809106, 6816832928, 21856821554, 69922091542, 223229394256, 711333766468, 2262803472594, 7186710244256
Offset: 1
Some solutions for n=4
..0..1..2. .0..1..1. .2..2..1. .1..2..2. .1..0..0. .2..0..0. .2..2..2
..0..0..1. .0..0..0. .1..2..2. .2..2..1. .0..1..0. .1..0..0. .2..1..1
..1..0..0. .0..0..0. .2..1..2. .1..2..2. .0..0..1. .0..1..0. .2..2..2
..0..0..0. .1..0..1. .1..2..2. .2..1..1. .0..1..2. .0..0..0. .2..2..1
A268805
Number of nX4 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.
Original entry on oeis.org
60, 290, 1202, 5848, 28452, 135912, 640926, 2990786, 13835892, 63544542, 290056316, 1317009868, 5952527788, 26795651036, 120193389832, 537427198324, 2396207992178, 10656560102448, 47282655935580, 209348341875062
Offset: 1
Some solutions for n=4
..2..2..2..2. .2..2..2..1. .1..2..1..2. .2..2..1..2. .0..2..2..2
..2..1..2..1. .1..2..1..2. .1..2..2..2. .1..2..1..2. .1..2..1..2
..1..2..2..2. .2..2..2..2. .2..2..2..1. .2..2..2..2. .2..2..2..2
..2..2..1..2. .1..2..2..1. .1..2..2..2. .1..2..1..2. .1..2..2..2
A268806
Number of nX5 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.
Original entry on oeis.org
144, 772, 4158, 28452, 195384, 1316226, 8734264, 57302798, 372342650, 2400532536, 15373692036, 97900054556, 620374078660, 3914367133320, 24605301916568, 154148669247610, 962830699411796, 5997782979007294, 37271323919688010
Offset: 1
Some solutions for n=4
..0..0..1..0..1. .0..1..0..0..0. .2..1..2..2..1. .1..0..0..1..0
..0..0..0..0..1. .0..0..0..1..0. .2..1..2..2..2. .0..0..1..0..0
..1..0..1..0..0. .0..1..0..0..0. .2..2..2..2..2. .1..0..0..0..1
..0..0..0..0..0. .1..0..0..0..0. .2..1..2..2..2. .0..0..1..0..0
A268807
Number of nX6 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.
Original entry on oeis.org
336, 1972, 14308, 135912, 1316226, 12432856, 115671422, 1062318610, 9657289546, 87052567448, 779167091050, 6932066063186, 61353778718298, 540579543332426, 4744132651089162, 41488807479780664, 361699301828001722
Offset: 1
Some solutions for n=4
..0..1..0..1..0..0. .1..2..2..2..1..2. .2..1..2..2..2..2. .0..0..1..0..0..1
..1..0..0..0..1..0. .1..2..2..2..2..1. .1..2..2..2..2..2. .0..0..1..0..0..0
..0..0..1..0..0..0. .2..2..2..2..2..2. .2..1..2..2..2..1. .1..0..0..0..0..0
..1..0..0..1..0..1. .2..2..2..2..2..1. .2..2..1..2..2..2. .0..1..0..1..0..0
A268808
Number of nX7 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.
Original entry on oeis.org
768, 4914, 48460, 640926, 8734264, 115671422, 1508087180, 19390335102, 246666802206, 3110082281974, 38924665296474, 484120668061458, 5988867204857378, 73740656947715536, 904257358969806890
Offset: 1
Some solutions for n=3
..2..2..2..2..2..1..2. .0..0..0..1..0..0..0. .0..0..1..0..1..0..0
..2..2..2..2..2..2..1. .0..0..0..0..1..0..1. .1..0..0..1..0..0..1
..1..2..1..2..1..0..0. .0..1..0..0..0..0..1. .0..1..0..0..1..0..0
Showing 1-7 of 7 results.
Comments