A206067 Number of (n+1) X 4 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three clockwise edge increases.

537, 3330, 27654, 233058, 1967814, 16608978, 140136942, 1182218562, 9972840630, 84126136626, 709642323294, 5986137534306, 50495575069542, 425951091141138, 3593073160699854, 30309051837484290, 255669326170893078

Offset

1,1

Comments

Column 3 of A206072.

Links

R. H. Hardin, Table of n, a(n) for n = 1..210

Formula

Empirical: a(n) = 14*a(n-1) -56*a(n-2) +82*a(n-3) -47*a(n-4) for n>9.

Example

Some solutions for n=4
..1..2..1..1....1..0..0..2....2..0..0..1....0..0..1..1....1..0..0..1
..0..1..0..2....0..2..1..0....0..2..1..0....2..1..0..2....0..2..1..0
..0..2..1..0....2..1..0..1....1..0..2..1....0..2..1..0....1..0..2..1
..1..0..2..1....0..2..1..2....2..1..0..2....1..0..2..1....2..1..0..2
..2..1..0..2....1..0..2..0....1..2..1..0....2..1..0..2....0..2..1..0

Crossrefs

Cf. A206072.

Sequence in context: A077076 A033916 A236879 * A183725 A235780 A235785

Adjacent sequences: A206064 A206065 A206066 * A206068 A206069 A206070

Keyword

nonn

Author

R. H. Hardin, Feb 03 2012

Status

approved