|
|
A235673
|
|
Number of (n+1) X (2+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.
|
|
1
|
|
|
58, 380, 2456, 15790, 101398, 650928, 4178316, 26820102, 172154058, 1105028596, 7092994476, 45528746034, 292241404878, 1875848682364, 12040758823136, 77287616186486, 496096276240318, 3184358988382152, 20439867526684676
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 8*a(n-1) - 9*a(n-2) - 9*a(n-3) + 10*a(n-4) + 3*a(n-5) - 2*a(n-6).
Empirical g.f.: 2*x*(29 - 42*x - 31*x^2 + 42*x^3 + 11*x^4 - 8*x^5) / ((1 - x)*(1 - x - x^2)*(1 - 6*x - 3*x^2 + 2*x^3)). - Colin Barker, Oct 19 2018
|
|
EXAMPLE
|
Some solutions for n=5:
..0..0..0....1..1..0....0..1..0....1..1..1....1..0..1....0..0..1....1..1..0
..1..0..1....1..0..0....0..1..1....1..0..0....0..0..1....1..0..1....0..1..1
..0..1..1....1..0..1....0..0..1....1..0..1....0..0..0....0..1..1....1..0..0
..1..0..0....0..1..0....1..1..1....1..1..1....0..0..1....0..0..0....1..1..0
..0..0..1....1..0..1....1..0..1....1..0..1....0..0..0....0..0..1....0..0..1
..1..1..1....0..1..1....1..1..1....1..0..1....0..0..0....0..0..1....1..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|