|
|
A283276
|
|
Number of n X 2 0..1 arrays with no 1 equal to more than two of its horizontal, vertical and antidiagonal neighbors.
|
|
1
|
|
|
4, 15, 50, 176, 614, 2141, 7472, 26070, 90964, 317393, 1107448, 3864117, 13482703, 47043939, 164146038, 572739484, 1998406551, 6972853897, 24329729820, 84891460788, 296203869417, 1033516580387, 3606153167543, 12582614458784
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) + a(n-2) + 3*a(n-3) - 2*a(n-4) + a(n-5) - 2*a(n-6) + a(n-7) - a(n-8).
Empirical g.f.: x*(4 + 3*x + x^2 - x^3 - x^4 - x^5 - x^7) / (1 - 3*x - x^2 - 3*x^3 + 2*x^4 - x^5 + 2*x^6 - x^7 + x^8). - Colin Barker, Feb 21 2019
|
|
EXAMPLE
|
Some solutions for n=4:
..1..0. .1..1. .1..1. .0..1. .1..0. .0..1. .1..1. .0..1. .1..1. .1..1
..1..1. .1..0. .0..1. .0..1. .0..1. .1..0. .0..1. .1..1. .0..1. .0..0
..0..0. .0..1. .0..0. .1..0. .0..1. .0..1. .0..1. .0..0. .1..0. .0..1
..0..0. .0..1. .1..1. .0..0. .0..1. .0..0. .0..0. .1..1. .1..0. .0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|