|
|
A206058
|
|
Number of (n+1)X4 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases
|
|
1
|
|
|
19832, 167960, 1278672, 11155584, 101369476, 910785080, 8150091296, 73102971728, 659630705472, 5908995673000, 53009382259744, 478167664129504, 4283688188281176, 38437914754884704, 346627362250708048
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = a(n-2) +695*a(n-3) +2*a(n-4) +1693*a(n-5) -1278*a(n-7) +682*a(n-9) +286*a(n-11) +32*a(n-13) for n>20
|
|
EXAMPLE
|
Some solutions for n=4
..0..3..0..0....1..2..2..3....1..2..1..1....1..2..1..3....3..0..1..1
..0..0..3..0....3..3..0..1....1..3..0..3....2..0..1..1....3..1..1..3
..1..0..0..3....3..3..1..1....1..2..2..3....2..2..3..0....1..1..2..0
..2..1..0..0....2..1..1..0....3..2..2..1....3..2..2..3....2..3..3..0
..2..2..1..0....3..1..2..1....0..1..3..3....2..3..2..2....0..3..3..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|