login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A205979
Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two clockwise edge increases.
1
81, 423, 2232, 11568, 60432, 315357, 1643538, 8574615, 44720319, 233223303, 1216434498, 6344254641, 33088388283, 172573776357, 900058321935, 4694264219421, 24482997863997, 127691295254772, 665975373377820
OFFSET
1,1
COMMENTS
Column 1 of A205986.
LINKS
FORMULA
Empirical: a(n) = 2*a(n-1) + 10*a(n-2) + 35*a(n-3) + a(n-4) + 3*a(n-5) + a(n-6) + 2*a(n-7).
Empirical g.f.: 3*x*(27 + 87*x + 192*x^2 + 13*x^3 + 30*x^4 + 9*x^5 + 14*x^6) / (1 - 2*x - 10*x^2 - 35*x^3 - x^4 - 3*x^5 - x^6 - 2*x^7). - Colin Barker, Jun 13 2018
EXAMPLE
Some solutions for n=4:
..2..1....1..2....2..2....2..0....1..1....2..0....0..1....2..1....2..0....2..2
..2..1....2..2....2..0....1..0....1..1....1..2....2..2....2..0....2..2....0..2
..0..2....0..2....0..2....0..0....0..2....1..2....2..2....0..1....0..2....2..0
..1..1....1..0....1..2....1..1....1..2....2..0....1..0....0..0....2..0....2..0
..1..2....1..1....0..1....2..0....0..1....0..0....2..0....0..1....2..2....2..1
CROSSREFS
Cf. A205986.
Sequence in context: A206668 A238180 A206414 * A206661 A238173 A206407
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 02 2012
STATUS
approved