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

A206089
Number of (n+1) X 4 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
1
972, 2016, 4560, 13344, 33792, 86496, 240192, 608256, 1556928, 4323456, 10948608, 28024704, 77822208, 197074944, 504444672, 1400799744, 3547348992, 9080004096, 25214395392, 63852281856, 163440073728, 453859117056, 1149341073408
OFFSET
1,1
COMMENTS
Column 3 of A206094.
LINKS
FORMULA
Empirical: a(n) = 18*a(n-3) for n>6.
EXAMPLE
Some solutions for n=4:
..2..2..0..2....2..2..0..1....0..0..1..2....0..0..1..2....1..2..1..1
..0..2..2..0....2..0..1..1....1..0..0..1....0..1..2..2....0..1..1..0
..1..0..2..2....0..1..1..0....0..1..0..0....1..2..2..1....1..1..0..2
..1..1..0..2....1..1..0..2....0..0..2..2....2..2..0..2....0..0..2..2
..2..1..1..0....1..0..2..2....1..0..2..1....0..0..2..2....2..0..2..0
CROSSREFS
Sequence in context: A217161 A243861 A171771 * A217162 A203375 A183359
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 03 2012
STATUS
approved