A259422 Number of (n+1)X(3+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0011 or 0111.
142, 1366, 12953, 123306, 1172659, 11155819, 106118138, 1009466878, 9602626846, 91346008647, 868937609248, 8265855103277, 78629755083895, 747973270226802, 7115169104694298, 67683744437222992, 643848260656503313
Offset: 1
Keywords
Examples
Some solutions for n=4 ..0..1..0..0....1..0..0..0....0..0..1..0....1..0..1..1....1..1..0..0 ..1..1..0..0....1..0..1..1....1..0..0..0....0..0..0..1....0..1..0..1 ..0..0..0..1....1..0..0..0....0..0..1..0....0..0..0..0....0..1..0..0 ..1..0..1..1....1..1..1..1....1..0..0..0....0..0..0..0....0..0..0..0 ..0..0..0..0....0..0..1..0....1..0..0..0....0..1..1..1....0..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A259427
Formula
Empirical: a(n) = 6*a(n-1) +41*a(n-2) -44*a(n-3) -278*a(n-4) +51*a(n-5) +426*a(n-6) +36*a(n-7) -131*a(n-8)
Comments