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.

A235442 Number of (n+1)X(n+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.

This page as a plain text file.
%I A235442 #6 Jul 23 2025 08:34:18
%S A235442 16,382,28962,7017768,5485253042,13868068262164,113555975474406500,
%T A235442 3012872125570872924612
%N A235442 Number of (n+1)X(n+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.
%C A235442 Diagonal of A235449
%e A235442 Some solutions for n=3
%e A235442 ..1..1..0..1....0..1..0..1....0..0..1..1....0..0..1..1....1..1..1..1
%e A235442 ..1..1..0..1....1..0..1..0....0..0..1..0....0..1..0..1....0..0..1..0
%e A235442 ..1..0..0..1....0..1..0..1....0..0..1..1....1..1..1..0....1..1..1..0
%e A235442 ..1..1..1..0....1..1..1..1....1..1..1..0....0..0..0..1....0..1..0..1
%K A235442 nonn
%O A235442 1,1
%A A235442 _R. H. Hardin_, Jan 10 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.