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”).

A235926
Number of (n+1) X (1+1) 0..3 arrays with the minimum plus the maximum unequal to the lower median plus the upper median in every 2 X 2 subblock.
1
168, 1788, 18992, 201976, 2146656, 22822704, 242602688, 2579082208, 27416534400, 291455295168, 3098309729024, 32936787698560, 350135170930176, 3722127720923904, 39568195366759424, 420631235622297088
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 82*a(n-2) + 320*a(n-3) + 144*a(n-4) - 448*a(n-5) + 64*a(n-6).
Empirical g.f.: 4*x*(42 + 447*x + 1304*x^2 + 400*x^3 - 1760*x^4 + 256*x^5) / (1 - 82*x^2 - 320*x^3 - 144*x^4 + 448*x^5 - 64*x^6). - Colin Barker, Oct 20 2018
EXAMPLE
Some solutions for n=3:
..0..1....1..3....1..3....3..2....3..0....3..3....1..3....1..0....2..1....0..0
..2..0....0..1....3..3....3..1....1..0....1..0....0..1....3..1....3..3....2..0
..0..3....0..3....1..2....3..3....0..2....1..3....3..0....3..0....1..3....0..3
..0..2....1..3....2..2....3..2....2..3....0..0....3..3....3..3....0..1....1..3
CROSSREFS
Column 1 of A235932.
Sequence in context: A263121 A216107 A235932 * A279725 A234730 A234815
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 17 2014
STATUS
approved