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.

A235446 Number of (n+1)X(5+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 A235446 #6 Jul 23 2025 08:34:31
%S A235446 2644,102376,3886120,146213244,5485253042,205551169550,7699719982722,
%T A235446 288383414393138,10800536489561114,404495358726610494,
%U A235446 15148844516247948642,567341751928412753520,21247593602541105806608
%N A235446 Number of (n+1)X(5+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.
%C A235446 Column 5 of A235449
%H A235446 R. H. Hardin, <a href="/A235446/b235446.txt">Table of n, a(n) for n = 1..210</a>
%e A235446 Some solutions for n=2
%e A235446 ..1..1..1..1..0..1....0..1..0..1..0..0....1..0..1..0..0..1....0..0..0..1..0..1
%e A235446 ..0..1..0..1..1..0....0..1..1..0..0..1....0..1..0..1..0..1....0..0..1..0..1..0
%e A235446 ..1..1..1..0..0..0....1..1..0..0..1..0....1..0..0..1..0..1....1..0..1..1..0..0
%K A235446 nonn
%O A235446 1,1
%A A235446 _R. H. Hardin_, Jan 10 2014