|
|
A205979
|
|
Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two clockwise edge increases.
|
|
1
|
|
|
81, 423, 2232, 11568, 60432, 315357, 1643538, 8574615, 44720319, 233223303, 1216434498, 6344254641, 33088388283, 172573776357, 900058321935, 4694264219421, 24482997863997, 127691295254772, 665975373377820
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 2*a(n-1) + 10*a(n-2) + 35*a(n-3) + a(n-4) + 3*a(n-5) + a(n-6) + 2*a(n-7).
Empirical g.f.: 3*x*(27 + 87*x + 192*x^2 + 13*x^3 + 30*x^4 + 9*x^5 + 14*x^6) / (1 - 2*x - 10*x^2 - 35*x^3 - x^4 - 3*x^5 - x^6 - 2*x^7). - Colin Barker, Jun 13 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..2..1....1..2....2..2....2..0....1..1....2..0....0..1....2..1....2..0....2..2
..2..1....2..2....2..0....1..0....1..1....1..2....2..2....2..0....2..2....0..2
..0..2....0..2....0..2....0..0....0..2....1..2....2..2....0..1....0..2....2..0
..1..1....1..0....1..2....1..1....1..2....2..0....1..0....0..0....2..0....2..0
..1..2....1..1....0..1....2..0....0..1....0..0....2..0....0..1....2..2....2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|