|
|
A281029
|
|
Number of nX3 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
|
|
1
|
|
|
0, 2, 96, 532, 2321, 8886, 31700, 108034, 357542, 1158596, 3694697, 11633400, 36255175, 112035020, 343760934, 1048431286, 3181035325, 9608044744, 28905403029, 86656025654, 258976361436, 771797361724, 2294287282225
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 6*a(n-1) -11*a(n-2) +4*a(n-3) +19*a(n-4) -46*a(n-5) +23*a(n-6) +4*a(n-7) -59*a(n-8) +26*a(n-9) -37*a(n-10) -20*a(n-11) +4*a(n-12) -36*a(n-13) -8*a(n-15) -8*a(n-16) -4*a(n-18) for n>21
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0. .0..1..0. .0..0..1. .0..0..1. .0..0..0. .0..1..0. .0..1..0
..0..1..0. .1..1..1. .0..1..1. .1..0..1. .0..1..0. .0..0..0. .0..1..0
..0..1..0. .1..0..0. .1..0..1. .1..1..1. .0..1..1. .1..1..1. .1..0..1
..1..0..1. .1..0..0. .0..1..0. .0..0..1. .1..0..0. .0..0..1. .0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|