|
|
A281405
|
|
Number of 6 X n 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
|
|
1
|
|
|
0, 676, 3838, 7064, 13446, 23216, 37462, 57468, 87252, 135112, 211998, 333400, 526832, 834536, 1322878, 2100904, 3340468, 5310496, 8440806, 13411668, 21294588, 33787028, 53571622, 84875628, 134369192, 212570368, 336041114, 530858836
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 4*a(n-1) -6*a(n-2) +6*a(n-3) -7*a(n-4) +6*a(n-5) -a(n-6) -4*a(n-7) +5*a(n-8) -4*a(n-9) +4*a(n-10) -2*a(n-11) -a(n-12) +2*a(n-13) -a(n-14) for n>25.
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..0..1. .0..1..1..1. .0..1..0..0. .0..1..1..0. .0..1..0..1
..0..1..0..1. .0..1..0..1. .1..0..1..1. .0..0..0..1. .0..1..0..1
..0..1..0..1. .0..1..0..1. .1..0..1..0. .0..1..0..1. .0..1..1..1
..0..1..0..1. .1..1..0..1. .1..0..1..0. .0..1..0..1. .0..1..0..1
..0..0..0..1. .1..0..0..1. .1..1..1..1. .0..1..0..1. .0..1..0..0
..0..1..0..1. .1..0..1..1. .1..0..0..0. .0..1..0..0. .1..1..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|