A269182 Number of nX4 0..3 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling three exactly once.
108, 2736, 80112, 2097552, 52394312, 1265974992, 29881402560, 693021071760, 15854541802056, 358760880894864, 8045649521280080, 179088561311942528, 3961164069598726264, 87139967884594089296, 1907940856141713336608
Offset: 1
Keywords
Examples
Some solutions for n=3 ..0..2..2..2. .0..2..0..2. .1..1..3..3. .2..3..3..2. .2..0..1..0 ..3..2..2..2. .2..2..0..2. .1..3..3..1. .2..2..2..3. .0..1..0..0 ..3..3..2..0. .0..0..0..1. .2..3..1..3. .3..2..0..2. .0..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A269186.
Formula
Empirical: a(n) = 46*a(n-1) -607*a(n-2) +1264*a(n-3) +11029*a(n-4) -27640*a(n-5) -86627*a(n-6) +153412*a(n-7) +308464*a(n-8) -329306*a(n-9) -438615*a(n-10) +260680*a(n-11) +134834*a(n-12) -65824*a(n-13) -9889*a(n-14) +5080*a(n-15) -400*a(n-16) for n>17
Comments