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”).

A206065
Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three clockwise edge increases.
1
81, 150, 537, 2052, 7878, 29760, 112236, 423288, 1596672, 6022920, 22719480, 85701576, 323280168, 1219464936, 4600018536, 17352012360, 65454591240, 246905282472, 931366575720, 3513265045128, 13252602787272, 49990956668904
OFFSET
1,1
COMMENTS
Column 1 of A206072.
LINKS
FORMULA
Empirical: a(n) = 4*a(n-1) - a(n-2) + 2*a(n-4) for n>5.
Empirical g.f.: 3*x*(27 - 58*x + 6*x^2 + 18*x^3 + 15*x^4) / (1 - 4*x + x^2 - 2*x^4). - Colin Barker, Jun 13 2018
EXAMPLE
Some solutions for n=4:
..0..1....2..0....1..2....2..1....2..0....0..2....1..2....2..1....2..2....1..1
..2..2....0..0....0..0....2..2....1..2....2..2....0..1....0..2....0..0....2..2
..1..1....2..1....1..1....1..0....0..1....1..0....2..2....1..0....2..1....1..0
..0..2....0..2....0..2....2..1....0..2....0..2....0..0....2..1....0..2....0..1
..2..1....1..0....2..1....0..2....2..1....2..0....2..1....1..0....1..0....1..0
CROSSREFS
Cf. A206072.
Sequence in context: A207050 A206072 A207043 * A139705 A226643 A353456
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 03 2012
STATUS
approved