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

A237509
Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
1
97700, 1553960, 25188644, 519582770, 10729163264, 198237517632, 3611534827808, 70059004480444, 1372749454760336, 26024559034229214, 489347313650570220, 9371504780126738958, 180471591395652224156, 3441168553794813361486
OFFSET
1,1
COMMENTS
Column 6 of A237511
LINKS
EXAMPLE
Some solutions for n=1
..0..1..0..1..2..0..0....0..0..1..2..0..2..1....1..0..1..1..0..0..1
..1..2..2..1..1..1..1....1..0..1..0..0..1..1....2..0..1..1..0..1..1
CROSSREFS
Sequence in context: A251833 A145659 A022214 * A109185 A253823 A371950
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 08 2014
STATUS
approved