cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A236801 Number of (n+1)X(n+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.

Original entry on oeis.org

81, 1435, 85929, 16530709, 6612746409, 11092792124317, 27385111938746265, 497183007539695570813, 7087061017965887490247401
Offset: 1

Views

Author

R. H. Hardin, Jan 31 2014

Keywords

Comments

Diagonal of A236809

Examples

			Some solutions for n=3
..1..0..0..2....1..0..1..1....0..0..2..0....0..1..0..1....1..2..0..0
..1..1..0..1....2..2..2..1....1..2..1..2....2..0..0..0....0..0..1..2
..1..0..2..0....0..1..0..0....0..2..0..2....1..2..1..2....2..1..1..1
..1..1..2..1....0..0..0..1....2..1..2..1....1..1..1..1....0..0..1..2