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.

A251261 Number of (n+1)X(n+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01.

This page as a plain text file.
%I A251261 #6 Jun 02 2025 10:19:30
%S A251261 11,114,1667,32636,790734,22806904,760734085,28749778264,
%T A251261 1212060756101,56320777311152,2856799572599106,156942568859096170,
%U A251261 9277021941286520402,586789114650518446860,39528041606657916420501
%N A251261 Number of (n+1)X(n+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01.
%C A251261 Diagonal of A251268
%e A251261 Some solutions for n=4
%e A251261 ..0..0..0..0..0....0..0..0..1..1....1..0..0..0..1....0..0..1..1..1
%e A251261 ..0..0..0..0..1....1..1..1..1..1....0..1..1..1..1....0..0..0..0..1
%e A251261 ..0..0..1..1..1....0..0..0..0..1....0..0..1..1..1....0..0..0..1..1
%e A251261 ..0..1..0..0..1....0..0..0..1..1....0..0..0..0..0....1..1..1..1..1
%e A251261 ..0..0..1..1..1....0..0..1..0..0....0..1..1..1..1....0..0..1..1..1
%K A251261 nonn
%O A251261 1,1
%A A251261 _R. H. Hardin_, Dec 01 2014