|
|
A280228
|
|
Number of n X 3 0..1 arrays with no element unequal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
|
|
1
|
|
|
2, 6, 9, 16, 29, 52, 95, 168, 298, 522, 911, 1580, 2729, 4694, 8046, 13748, 23425, 39812, 67507, 114228, 192914, 325230, 547411, 919996, 1544029, 2588002, 4332630, 7245208, 12103013, 20197972, 33675911, 56098560, 93374074, 155296914
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 2*a(n-1) + a(n-2) - 2*a(n-3) - a(n-4) for n>7.
Empirical g.f.: x*(2 + 2*x - 5*x^2 - 4*x^3 + 2*x^4 + 2*x^5 + 3*x^6) / (1 - x - x^2)^2. - Colin Barker, Feb 13 2019
|
|
EXAMPLE
|
Some solutions for n=4:
..0..1..0. .0..0..0. .0..0..0. .0..0..0. .0..0..0. .0..0..0. .0..1..1
..0..0..0. .0..0..0. .0..0..0. .0..0..0. .0..0..0. .0..0..0. .1..1..1
..0..0..0. .1..1..0. .0..1..0. .0..0..0. .0..0..0. .0..1..1. .1..1..1
..0..0..0. .1..1..1. .0..0..0. .1..0..0. .0..0..1. .1..1..1. .1..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|