|
|
A206148
|
|
Number of (n+1) X 7 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
|
|
1
|
|
|
4374, 106494, 2646540, 66274542, 1664748270, 41869995708, 1053631126386, 26519876081106, 667567685148144, 16804916171955954, 423043134930340686, 10649666547770137380, 268094963505457212522, 6749037530485227993642
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 55*a(n-1) -1109*a(n-2) +11330*a(n-3) -67206*a(n-4) +247404*a(n-5) -582440*a(n-6) +881876*a(n-7) -846764*a(n-8) +499200*a(n-9) -172400*a(n-10) +33152*a(n-11) -3264*a(n-12) +128*a(n-13).
|
|
EXAMPLE
|
Some solutions for n=4:
..1..2..1..2..0..1..2....2..0..1..2..0..1..2....1..0..1..2..1..2..1
..0..1..0..1..2..0..1....1..2..0..1..2..0..1....2..1..2..0..2..1..0
..2..0..2..0..1..2..0....2..0..1..2..1..2..0....0..2..0..2..0..2..1
..1..2..0..2..0..1..2....0..2..0..1..2..0..2....1..0..1..0..1..0..2
..2..0..2..1..2..0..1....1..0..2..0..1..2..1....0..1..2..1..0..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|