A208106 Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.
25, 625, 2209, 9025, 46225, 261121, 1600225, 10220809, 67158025, 448380625, 3024450025, 20525433289, 139828879969, 954796716769, 6529082812849, 44686751584225, 306015929742721, 2096314482667729, 14363485816713121
Offset: 1
Keywords
Examples
Some solutions for n=5 ..1..0..0..1..1..0....0..0..1..1..1..0....0..0..1..1..1..1....1..0..1..1..1..1 ..1..1..0..0..1..1....0..1..1..1..1..1....0..0..1..1..1..1....1..1..0..1..1..0 ..1..0..1..1..1..0....0..0..1..1..1..0....1..0..1..1..1..1....1..0..0..1..1..1 ..1..1..0..0..1..1....1..0..1..1..1..1....0..0..1..1..1..1....1..0..1..1..1..0 ..1..0..1..1..1..0....0..0..1..1..1..0....1..1..1..1..1..1....1..1..0..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Formula
Empirical: a(n) = 11*a(n-1) -17*a(n-2) -124*a(n-3) +276*a(n-4) +396*a(n-5) -902*a(n-6) -462*a(n-7) +946*a(n-8) +220*a(n-9) -340*a(n-10) -44*a(n-11) +39*a(n-12) +3*a(n-13) -a(n-14) for n>15
Comments