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

A236905
Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal
1
1056, 6762, 44836, 326868, 2411550, 18527054, 143619570, 1138035570, 9082354564, 73458657386, 597388648952, 4899765429646, 40348694602260, 334106991780094, 2774430383216444, 23121941059834148, 193077412267829618
OFFSET
1,1
COMMENTS
Column 2 of A236911
LINKS
EXAMPLE
Some solutions for n=3
..1..2..3....0..3..0....1..1..3....0..2..3....3..3..0....2..2..2....3..0..3
..2..1..0....3..0..3....3..2..1....3..3..0....3..0..3....3..0..3....0..3..3
..2..2..3....0..3..0....0..3..2....0..3..3....3..0..3....2..1..2....3..3..0
..3..0..1....0..3..0....2..3..0....1..3..0....2..3..3....2..1..2....0..0..3
CROSSREFS
Sequence in context: A359624 A225714 A158692 * A281079 A023072 A168627
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 01 2014
STATUS
approved