|
| |
|
|
A206132
|
|
Number of (n+1) X 4 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
|
|
1
|
|
|
|
3092, 91924, 2761756, 83120732, 2502596196, 75353928196, 2268967605164, 68320694237116, 2057200342508100, 61944247178059108, 1865199913242292140, 56162935264244462556, 1691119155959930890244, 50921198959363203903524
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Column 3 of A206137.
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
|
FORMULA
|
Empirical: a(n) = 46*a(n-1) -573*a(n-2) +3120*a(n-3) -8589*a(n-4) +11686*a(n-5) -4877*a(n-6) -5572*a(n-7) +6702*a(n-8) -1664*a(n-9) -390*a(n-10) +112*a(n-11).
|
|
|
EXAMPLE
|
Some solutions for n=4:
..1..0..1..0....1..3..2..3....2..0..2..3....0..2..0..1....0..1..0..1
..2..1..2..1....3..1..3..2....1..2..0..1....3..1..2..0....2..3..1..3
..1..0..1..2....1..2..0..3....2..3..1..2....2..3..0..1....3..1..0..1
..0..2..3..0....3..0..3..1....3..1..2..3....0..1..2..3....0..3..1..2
..1..3..0..3....0..1..0..2....0..3..0..1....1..3..0..1....1..0..2..3
|
|
|
CROSSREFS
|
Sequence in context: A277786 A092129 A251871 * A187305 A236121 A252884
Adjacent sequences: A206129 A206130 A206131 * A206133 A206134 A206135
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin, Feb 04 2012
|
|
|
STATUS
|
approved
|
| |
|
|
