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

A235878
Number of (n+1) X (2+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.
1
51, 105, 231, 537, 1311, 3345, 8871, 24297, 68271, 195585, 568311, 1668057, 4930431, 14643825, 43636551, 130319817, 389779791, 1166980065, 3496221591, 10479227577, 31418808351, 94218676305, 282580531431, 847590599337, 2542469808111
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 6*a(n-1) - 11*a(n-2) + 6*a(n-3).
Conjectures from Colin Barker, Oct 19 2018: (Start)
G.f.: 3*x*(17 - 67*x + 54*x^2) / ((1 - x)*(1 - 2*x)*(1 - 3*x)).
a(n) = 3*(2 + 3*2^(1+n) + 3^n).
(End)
EXAMPLE
Some solutions for n=5:
..2..2..2....2..2..2....0..0..0....2..0..0....0..1..1....2..0..2....2..2..2
..0..0..0....2..2..2....0..0..0....2..0..0....1..0..0....2..0..2....0..0..0
..2..2..2....1..1..1....1..1..1....2..0..0....1..0..0....0..2..0....1..1..1
..0..0..0....1..1..1....1..1..1....2..0..0....1..0..0....0..2..0....1..1..1
..2..2..2....0..0..0....1..1..1....0..2..2....1..0..0....2..0..2....2..2..2
..1..1..1....1..1..1....0..0..0....2..0..0....1..0..0....0..2..0....2..2..2
CROSSREFS
Column 2 of A235884.
Sequence in context: A044521 A160847 A260517 * A015705 A359088 A044238
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 16 2014
STATUS
approved