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.

A253390 Number of (n+1)X(n+1) 0..1 arrays with every 2X2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically.

This page as a plain text file.
%I A253390 #7 Jul 23 2025 14:01:36
%S A253390 16,102,174,346,666,1318,2726,5396,11392,22634,47926,95464,201644,
%T A253390 402272,846688,1690724,3546388,7086130,14818262,29621624,61778428,
%U A253390 123532896,257035176,514085752,1067445536,2135305688,4425565336,8853923848
%N A253390 Number of (n+1)X(n+1) 0..1 arrays with every 2X2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically.
%C A253390 Diagonal of A253397
%H A253390 R. H. Hardin, <a href="/A253390/b253390.txt">Table of n, a(n) for n = 1..69</a>
%e A253390 Some solutions for n=4
%e A253390 ..1..0..0..1..1....1..0..1..0..1....0..0..1..0..1....0..1..0..1..1
%e A253390 ..0..0..0..1..0....1..0..1..0..1....0..0..1..0..1....1..1..0..1..0
%e A253390 ..1..1..0..1..0....1..0..1..0..1....0..0..1..0..1....0..1..0..1..0
%e A253390 ..0..1..0..1..0....1..0..1..0..1....1..0..1..0..1....0..1..0..1..0
%e A253390 ..0..1..0..1..0....1..0..1..0..1....0..0..1..0..1....0..1..0..1..0
%K A253390 nonn
%O A253390 1,1
%A A253390 _R. H. Hardin_, Dec 31 2014