A268993 Number of nX6 binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.
41, 763, 14080, 244397, 4097199, 66954420, 1073436321, 16957258387, 264744926212, 4093941136805, 62806688095479, 957111538353668, 14502245681077257, 218656000387543867, 3282569954305098964
Offset: 1
Keywords
Examples
Some solutions for n=3 ..0..1..0..0..0..1. .1..0..1..0..0..1. .0..0..0..0..0..0. .0..0..1..0..1..0 ..0..1..0..0..0..0. .1..0..0..0..0..1. .1..0..0..0..0..0. .1..0..0..0..1..1 ..1..0..0..0..1..0. .0..1..1..0..0..1. .1..0..0..0..1..0. .0..0..0..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A268995.
Formula
Empirical: a(n) = 42*a(n-1) -665*a(n-2) +5138*a(n-3) -21972*a(n-4) +55274*a(n-5) -83769*a(n-6) +76202*a(n-7) -40273*a(n-8) +11304*a(n-9) -1296*a(n-10) for n>12
Comments