|
| |
|
|
A281649
|
|
Number of nX3 0..2 arrays with no element equal to more than one 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
|
|
|
|
1, 70, 985, 10572, 104815, 982206, 8921869, 79152992, 690169163, 5936924514, 50519131945, 426076889988, 3566942546599, 29673740170566, 245529558834373, 2022092139217448, 16585031242812675, 135537068349013930
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
Column 3 of A281653.
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
|
FORMULA
|
Empirical: a(n) = 14*a(n-1) -29*a(n-2) -192*a(n-3) +136*a(n-4) +1336*a(n-5) +1164*a(n-6) -2528*a(n-7) -6176*a(n-8) -5120*a(n-9) -1600*a(n-10) for n>13
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..2. .0..1..0. .0..0..1. .0..0..1. .0..1..1. .0..1..0. .0..1..2
..2..0..1. .0..0..0. .1..0..1. .0..1..0. .2..0..2. .2..2..0. .0..1..1
..2..2..2. .2..1..0. .1..2..1. .2..1..0. .2..0..1. .2..1..0. .0..1..2
..0..1..0. .0..2..1. .1..0..0. .0..2..0. .1..1..2. .0..1..2. .2..0..2
|
|
|
CROSSREFS
|
Cf. A281653.
Sequence in context: A251933 A061170 A125114 * A189413 A229735 A254472
Adjacent sequences: A281646 A281647 A281648 * A281650 A281651 A281652
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin, Jan 26 2017
|
|
|
STATUS
|
approved
|
| |
|
|
