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

A205985
Number of (n+1) X 8 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two clockwise edge increases.
1
1643538, 2482596, 6296976, 35107968, 279003648, 2260666464, 19410499584, 160992300384, 1323215405568, 11406249937152, 94660267282560, 778050772950528, 6706874963045376, 55660237162145280, 457493854494910464
OFFSET
1,1
COMMENTS
Column 7 of A205986.
LINKS
FORMULA
Empirical: a(n) = 588*a(n-3) for n>12.
EXAMPLE
Some solutions for n=4
..2..1..0..2..1..2..2..1....0..0..0..2..0..0..0..2....1..2..0..1..1..1..2..2
..1..0..0..1..2..2..0..2....2..2..1..2..2..1..2..1....2..2..0..0..2..1..1..0
..0..0..1..2..2..1..2..2....0..2..2..1..2..2..0..1....0..0..2..0..0..2..1..1
..0..1..2..2..0..2..2..0....1..0..2..2..0..2..2..1....1..0..0..1..0..0..2..1
..0..2..2..0..1..2..1..2....1..1..0..2..2..0..2..2....0..2..0..0..2..0..0..2
CROSSREFS
Cf. A205986.
Sequence in context: A255042 A255035 A256953 * A258953 A342429 A144127
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 02 2012
STATUS
approved