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

A238069
Number of (n+1)X(5+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
1
438768, 14168952, 363809888, 10213967484, 323819924384, 9500262069216, 300828077426994, 9035028981379256, 288763387135691996, 8588440332702563980, 272588711572505400802, 8184709431799163625060, 261311859323053903460964
OFFSET
1,1
COMMENTS
Column 5 of A238072
LINKS
EXAMPLE
Some solutions for n=1
..1..2..0..3..1..2....0..0..1..3..0..0....0..2..1..2..1..0....0..0..2..2..2..2
..2..1..1..1..2..1....1..2..3..1..2..2....1..3..2..1..0..3....3..2..2..1..0..3
CROSSREFS
Sequence in context: A186048 A306867 A163612 * A234150 A294987 A350334
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 17 2014
STATUS
approved