|
|
A206069
|
|
Number of (n+1)X6 0..2 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases
|
|
1
|
|
|
7878, 103194, 1967814, 38532894, 759076386, 14970344658, 295275611838, 5823726851622, 114855474850530, 2265100634575482, 44669845159506126, 880919674587106662, 17372218977042484098, 342588405720989078730
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 50*a(n-1) -967*a(n-2) +9758*a(n-3) -58681*a(n-4) +225870*a(n-5) -576896*a(n-6) +980296*a(n-7) -1057712*a(n-8) +604854*a(n-9) +7921*a(n-10) -283098*a(n-11) +215171*a(n-12) -85894*a(n-13) +23942*a(n-14) -5340*a(n-15) +663*a(n-16) for n>21
|
|
EXAMPLE
|
Some solutions for n=4
..1..2..0..2..1..1....2..1..1..0..2..1....1..0..0..1..0..0....1..0..1..1..0..1
..2..1..2..1..0..2....1..0..2..1..0..2....0..2..1..0..2..1....2..1..0..2..1..2
..1..2..0..2..1..0....0..1..0..2..1..0....2..0..2..1..0..2....1..2..1..0..2..0
..1..0..1..0..2..1....0..2..1..0..2..1....0..1..0..2..1..0....1..0..2..1..0..1
..2..1..0..1..0..2....1..0..2..1..0..2....0..2..1..0..2..1....0..2..0..2..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|