|
|
A238907
|
|
Number of (n+1) X (2+1) 0..2 arrays with no element equal to all horizontal neighbors or equal to all vertical neighbors, and new values 0..2 introduced in row major order.
|
|
1
|
|
|
9, 41, 486, 4287, 41165, 385632, 3638773, 34262775, 322817734, 3040984385, 28647966717, 269877546432, 2542386946921, 23950576862273, 225626690048980, 2125518640310461, 20023471678068295, 188631332893572912
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 6*a(n-1) +32*a(n-2) +8*a(n-3) -51*a(n-4) -43*a(n-5) -5*a(n-6) +37*a(n-7) -5*a(n-8) -2*a(n-9) +4*a(n-10).
|
|
EXAMPLE
|
Some solutions for n=5
..0..1..0....0..1..2....0..1..0....0..1..2....0..1..2....0..1..0....0..1..2
..2..0..2....2..0..1....2..0..1....1..2..1....1..0..1....1..0..1....1..0..1
..2..0..2....1..2..0....0..1..0....2..1..0....1..2..0....0..2..0....1..2..1
..0..2..0....1..0..2....2..0..2....1..2..0....0..1..2....2..0..2....2..0..2
..0..2..1....0..2..1....1..2..1....2..0..1....0..1..2....1..2..0....1..0..2
..2..0..2....1..0..2....0..1..0....0..1..0....2..0..1....2..0..1....0..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|