|
|
A281474
|
|
Number of 6 X n 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.
|
|
1
|
|
|
32, 857, 283, 405, 534, 706, 924, 1190, 1602, 2290, 3374, 5036, 7604, 11522, 17514, 26762, 41012, 62916, 96636, 148524, 228308, 351060, 539950, 830528, 1277578, 1965406, 3023596, 4651588, 7156298, 11009776, 16938296, 26059354, 40092080
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 2*a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-6) - a(n-7) for n>12.
Empirical g.f.: x*(32 + 793*x - 1399*x^2 + 664*x^3 - 818*x^4 + 617*x^5 - 108*x^6 - 906*x^7 + 548*x^8 - 64*x^9 + x^10 - 6*x^11) / ((1 - x)*(1 - x - x^3 - x^6)). - Colin Barker, Feb 19 2019
|
|
EXAMPLE
|
Some solutions for n=4:
..0..1..1..0. .0..1..1..0. .0..1..0..0. .0..1..0..1. .0..0..1..0
..0..0..1..0. .0..0..1..0. .1..0..1..1. .0..1..0..1. .1..0..1..0
..1..0..1..0. .1..0..1..1. .1..0..1..0. .0..1..0..1. .0..0..1..0
..1..0..1..1. .1..0..0..1. .0..0..1..0. .1..0..1..0. .0..1..1..0
..0..1..0..0. .1..1..0..1. .0..1..1..0. .1..0..1..0. .0..1..0..0
..0..1..0..1. .0..1..0..0. .0..1..0..0. .1..0..1..1. .0..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|