|
|
A206192
|
|
Number of (n+1)X4 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two
|
|
1
|
|
|
8304, 329216, 13173864, 527945420, 21162670972, 848327900384, 34006136221640, 1363171550451384, 54644142459882172, 2190466837748368020, 87807121912310588320, 3519839010271451725584, 141096375518760876476256
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 69*a(n-1) -1503*a(n-2) +16061*a(n-3) -100719*a(n-4) +413071*a(n-5) -1200419*a(n-6) +2350991*a(n-7) -2650016*a(n-8) +246039*a(n-9) +5103223*a(n-10) -8853227*a(n-11) +5015318*a(n-12) +4249674*a(n-13) -9106668*a(n-14) +7509128*a(n-15) -3026335*a(n-16) +952523*a(n-17) -1880226*a(n-18) -37992*a(n-19) -166501*a(n-20) -450312*a(n-21) -419109*a(n-22) +222765*a(n-23) +217432*a(n-24) -15270*a(n-25) +13404*a(n-26) +5852*a(n-27) +348*a(n-28) for n>29
|
|
EXAMPLE
|
Some solutions for n=4
..2..3..3..0....1..1..2..0....1..0..2..1....2..1..1..2....1..3..3..3
..1..2..0..2....3..2..0..3....0..1..0..2....0..3..2..0....3..2..1..0
..3..1..1..3....0..3..1..0....2..2..1..3....3..0..3..2....0..3..2..1
..0..3..2..0....1..0..2..1....0..3..2..0....1..3..2..3....2..0..3..2
..3..0..3..1....3..2..3..2....1..0..3..1....2..0..3..2....2..1..0..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|