|
|
A205981
|
|
Number of (n+1) X 4 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two clockwise edge increases.
|
|
1
|
|
|
2232, 8004, 27060, 103998, 408411, 1599096, 6296976, 24685680, 96780240, 381085848, 1493933568, 5857190208, 23062636320, 90410256000, 354480099264, 1395709647744, 5471472881664, 21453307046400, 84465860912640
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 60*a(n-3) +8*a(n-5) for n>9.
Empirical g.f.: 3*x*(744 + 2668*x + 9020*x^2 - 9974*x^3 - 23943*x^4 - 14120*x^5 - 2312*x^6 - 11820*x^7 + 832*x^8) / (1 - 60*x^3 - 8*x^5). - Colin Barker, Jun 13 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..0..2..0..1....0..0..0..1....2..0..2..1....1..0..2..1....0..2..2..1
..1..2..2..1....1..2..1..1....0..2..2..0....1..1..0..1....2..1..2..2
..0..1..2..2....0..1..1..2....2..2..0..2....2..1..1..2....2..2..0..1
..0..0..1..1....1..1..2..0....0..0..1..1....0..2..1..1....1..2..2..0
..1..0..1..2....1..2..0..0....2..0..1..2....1..1..2..0....2..0..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|