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

A206190
Number of (n+1) X 2 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to two.
1
124, 1012, 8304, 68180, 559788, 4596072, 37735460, 309822148, 2543754976, 20885173732, 171475038268, 1407873792488, 11559167069396, 94905057577684, 779205793959872, 6397569158457620, 52526420432849004, 431261433077432552
OFFSET
1,1
COMMENTS
Column 1 of A206197.
LINKS
FORMULA
Empirical: a(n) = 9*a(n-1) - 7*a(n-2) + 4*a(n-3) + 2*a(n-4).
Empirical g.f.: 4*x*(31 - 26*x + 16*x^2 + 8*x^3) / (1 - 9*x + 7*x^2 - 4*x^3 - 2*x^4). - Colin Barker, Jun 14 2018
EXAMPLE
Some solutions for n=4:
2 0 1 1 3 3 2 3 0 1 3 0 2 3 3 3 2 0 0 1
1 0 3 2 1 0 3 0 0 2 1 0 0 1 1 0 2 1 0 2
0 1 0 3 2 1 1 2 1 3 0 3 2 0 2 1 1 2 3 2
0 3 1 0 1 3 3 2 3 0 2 0 0 1 0 2 0 1 1 3
1 0 2 1 1 0 0 3 0 3 1 1 3 0 0 3 1 2 0 3
CROSSREFS
Cf. A206197.
Sequence in context: A206085 A206078 A206197 * A251381 A251374 A209730
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 04 2012
STATUS
approved