|
|
A206146
|
|
Number of (n+1) X 5 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
|
|
1
|
|
|
486, 5118, 54450, 580986, 6204438, 66274542, 707982258, 7563227466, 80796885414, 863143206558, 9220857727842, 98505357616986, 1052321399885238, 11241828565189710, 120095162925973650, 1282962828563896554
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 16*a(n-1) - 65*a(n-2) + 92*a(n-3) - 48*a(n-4) + 8*a(n-5).
Empirical g.f.: 6*x*(81 - 443*x + 692*x^2 - 376*x^3 + 64*x^4) / (1 - 16*x + 65*x^2 - 92*x^3 + 48*x^4 - 8*x^5). - Colin Barker, Jun 13 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..2..0..1..2..1....0..1..0..1..2....1..0..1..2..0....0..2..1..2..0
..0..2..0..1..2....1..0..1..0..1....2..1..2..0..2....1..0..2..0..1
..1..0..1..0..1....0..1..0..1..2....0..2..0..2..0....2..1..0..1..0
..2..1..2..1..2....1..2..1..2..1....1..0..1..0..1....1..2..1..0..1
..0..2..1..2..0....0..1..0..1..2....2..1..2..1..0....2..0..2..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|