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.

This page as a plain text file.
%I A236801 #6 Jul 23 2025 09:34:03
%S A236801 81,1435,85929,16530709,6612746409,11092792124317,27385111938746265,
%T A236801 497183007539695570813,7087061017965887490247401
%N 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.
%C A236801 Diagonal of A236809
%e A236801 Some solutions for n=3
%e A236801 ..1..0..0..2....1..0..1..1....0..0..2..0....0..1..0..1....1..2..0..0
%e A236801 ..1..1..0..1....2..2..2..1....1..2..1..2....2..0..0..0....0..0..1..2
%e A236801 ..1..0..2..0....0..1..0..0....0..2..0..2....1..2..1..2....2..1..1..1
%e A236801 ..1..1..2..1....0..0..0..1....2..1..2..1....1..1..1..1....0..0..1..2
%K A236801 nonn
%O A236801 1,1
%A A236801 _R. H. Hardin_, Jan 31 2014

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.