|
|
A206147
|
|
Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
|
|
1
|
|
|
1458, 23346, 379602, 6204438, 101596896, 1664748270, 27284864220, 447232269654, 7330916855718, 120167900345196, 1969792468989480, 32288891319485190, 529280670290557896, 8675989562774602188, 142217172462541690296
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 30*a(n-1) - 291*a(n-2) + 1278*a(n-3) - 2901*a(n-4) + 3519*a(n-5) - 2152*a(n-6) + 516*a(n-7).
|
|
EXAMPLE
|
Some solutions for n=4:
..0..1..2..0..1..2....2..0..1..2..0..2....2..1..0..1..2..0....1..0..1..2..1..2
..1..0..1..2..0..1....0..2..0..1..2..0....0..2..1..2..1..2....2..1..2..0..2..1
..0..1..2..1..2..0....1..0..1..0..1..2....1..0..2..0..2..1....1..2..0..2..1..0
..2..0..1..0..1..2....2..1..2..1..2..0....2..1..0..1..0..2....0..1..2..1..0..1
..0..1..0..1..2..1....0..2..0..2..0..2....1..2..1..0..1..0....1..2..1..2..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|