|
|
A283693
|
|
Number of 3Xn 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.
|
|
1
|
|
|
8, 57, 264, 1521, 8687, 47829, 268285, 1503392, 8399236, 46998162, 262952663, 1470846540, 8228361722, 46031489681, 257506370211, 1440540994224, 8058660343663, 45081605428482, 252194893203897, 1410825055629845
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 5*a(n-1) +3*a(n-2) +15*a(n-3) -72*a(n-4) -21*a(n-5) +45*a(n-6) +96*a(n-7) +13*a(n-8) -115*a(n-9) +50*a(n-10) -14*a(n-11)
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..1..1. .0..1..0..0. .1..1..0..1. .0..0..0..1. .0..0..0..0
..0..0..1..0. .0..0..0..1. .0..1..0..1. .0..1..0..0. .0..1..0..0
..0..0..1..0. .0..1..0..1. .0..1..0..0. .1..1..0..1. .0..0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|