|
|
A207495
|
|
Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.
|
|
2
|
|
|
6, 36, 102, 297, 932, 2974, 9723, 32164, 107568, 362291, 1226924, 4170948, 14218841, 48567776, 166128066, 568812225, 1948947544, 6681079858, 22911053867, 78586955264, 269607037796, 925049643523, 3174213970624, 10892652172048
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 5*a(n-1) -2*a(n-2) -14*a(n-3) +6*a(n-4) +8*a(n-5) -a(n-6) -a(n-7) for n>8.
Empirical g.f.: x*(6 + 6*x - 66*x^2 - 57*x^3 + 119*x^4 + 72*x^5 - 19*x^6 - 11*x^7) / ((1 - x)*(1 - 2*x - x^2)*(1 - 2*x - 5*x^2 + x^4)). - Colin Barker, Mar 05 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..0..0..1....0..1..0....1..1..0....1..1..1....1..0..0....0..1..0....1..0..1
..1..1..0....1..1..0....1..0..1....1..1..1....0..0..1....0..0..1....1..1..0
..0..0..1....1..1..0....1..1..0....0..1..0....1..0..0....0..1..0....0..0..1
..1..1..0....1..0..0....0..0..1....1..1..1....1..0..1....0..0..1....1..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|