login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A237228
Number of (n+1) X (2+1) 0..2 arrays with the maximum plus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.
1
268, 984, 3284, 10888, 36180, 120540, 401520, 1336540, 4448892, 14811704, 49313092, 164172108, 546554288, 1819586828, 6057775468, 20167512408, 67141506132, 223527096380, 744165226864, 2477470556540, 8247979825436
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = a(n-1) + 4*a(n-2) + 5*a(n-3) + 21*a(n-4) + 12*a(n-5) + 4*a(n-6) for n>8.
Empirical g.f.: 4*x*(67 + 179*x + 307*x^2 + 582*x^3 + 402*x^4 + 127*x^5 - 6*x^6 - 8*x^7) / (1 - x - 4*x^2 - 5*x^3 - 21*x^4 - 12*x^5 - 4*x^6). - Colin Barker, Oct 21 2018
EXAMPLE
Some solutions for n=5:
..0..0..0....1..0..1....2..2..1....1..2..1....1..1..0....2..0..1....0..2..1
..0..1..2....1..1..2....0..1..2....2..1..0....1..2..2....1..0..0....0..1..1
..2..2..1....1..1..2....0..1..0....0..0..0....0..1..2....0..1..2....0..1..1
..2..1..0....1..0..0....2..1..1....1..1..2....0..0..0....1..2..1....2..2..1
..1..0..1....2..1..1....2..1..1....1..1..2....0..0..1....1..1..0....1..1..0
..1..0..2....1..1..1....0..0..1....0..1..0....0..1..2....1..1..0....1..1..1
CROSSREFS
Column 2 of A237234.
Sequence in context: A234878 A194774 A279184 * A190352 A235175 A235169
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 05 2014
STATUS
approved