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

A210293
Half the number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having at most one duplicate clockwise edge difference.
1
112, 1578, 22212, 312704, 4402192, 61973516, 872455004, 12282307884, 172908727756, 2434186513236, 34268160178956, 482422688537636, 6791483674595260, 95609621185469444, 1345979774260696316
OFFSET
1,1
COMMENTS
Column 1 of A210300.
LINKS
FORMULA
Empirical: a(n) = 11*a(n-1) + 42*a(n-2) + 20*a(n-3) - 18*a(n-4).
Empirical g.f.: 2*x*(56 + 173*x + 75*x^2 - 72*x^3) / (1 - 11*x - 42*x^2 - 20*x^3 + 18*x^4). - Colin Barker, Jul 15 2018
EXAMPLE
Some solutions for n=4:
..2..0....3..1....3..2....1..3....1..1....1..0....2..3....1..0....1..3....2..1
..3..0....1..0....3..0....1..3....2..2....2..0....0..1....0..0....2..2....1..1
..2..0....2..2....1..1....3..2....1..0....1..2....2..0....0..3....0..2....3..3
..3..1....1..1....1..2....1..3....0..3....1..3....0..1....1..3....2..1....0..1
..1..2....0..3....2..2....0..1....0..0....0..0....3..0....1..0....1..1....0..0
CROSSREFS
Cf. A210300.
Sequence in context: A367363 A327633 A210300 * A203915 A233884 A246895
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 19 2012
STATUS
approved