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

A238074
Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
1
256, 1592, 9884, 59772, 378708, 2285576, 14349272, 86693008, 546582828, 3300593268, 20768825876, 125443787248, 790067077480, 4771492579096, 30039037764956, 181425384418428, 1142390702895284, 6899484032213320
OFFSET
1,1
COMMENTS
Column 1 of A238081
LINKS
FORMULA
Empirical: a(n) = 17*a(n-2) +736*a(n-4) +2353*a(n-6) +2483*a(n-8) +800*a(n-10) for n>11
EXAMPLE
Some solutions for n=4
..2..2....0..2....1..1....0..0....3..2....0..1....1..0....1..1....2..2....1..3
..2..0....2..3....2..0....1..2....1..1....3..1....2..1....1..3....2..0....3..1
..3..1....1..1....3..1....1..1....1..2....1..2....1..1....2..0....3..1....0..2
..3..3....2..1....3..3....2..0....1..0....2..2....1..1....1..1....3..2....0..0
..2..0....3..1....3..2....3..3....0..1....0..1....2..1....1..0....3..0....3..3
CROSSREFS
Sequence in context: A237921 A237915 A238081 * A251974 A250429 A238155
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 17 2014
STATUS
approved