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.

A251093 Number of (n+1)X(n+1) 0..1 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element.

This page as a plain text file.
%I A251093 #7 Jul 23 2025 13:03:36
%S A251093 13,212,9597,1175519,391088995,353489877714,867470863709067,
%T A251093 5781820357157777986,104649732973693543280042,
%U A251093 5143991426222399264506760205,686661619658213553959701988139993
%N A251093 Number of (n+1)X(n+1) 0..1 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element.
%C A251093 Diagonal of A251100
%H A251093 R. H. Hardin, <a href="/A251093/b251093.txt">Table of n, a(n) for n = 1..15</a>
%e A251093 Some solutions for n=3
%e A251093 ..1..0..0..1....1..0..0..0....1..1..1..1....0..0..1..0....1..0..1..0
%e A251093 ..0..1..0..1....0..0..1..1....0..0..0..1....1..0..0..0....1..0..1..1
%e A251093 ..0..0..0..1....1..0..0..0....0..0..0..0....1..0..1..1....1..0..0..0
%e A251093 ..1..0..0..1....0..0..1..0....0..0..1..0....0..0..0..1....1..0..0..1
%K A251093 nonn
%O A251093 1,1
%A A251093 _R. H. Hardin_, Nov 29 2014