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.

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

This page as a plain text file.
%I A251094 #7 Nov 25 2018 09:35:23
%S A251094 41,212,1109,5817,30517,160086,839758,4405079,23107524,121214121,
%T A251094 635847599,3335437865,17496560104,91780937840,481451239589,
%U A251094 2525527648328,13248049600905,69494712657097,364545365754237,1912279634115658
%N A251094 Number of (n+1) X (2+1) 0..1 arrays with no 2 X 2 subblock having its minimum diagonal element less than its minimum antidiagonal element.
%H A251094 R. H. Hardin, <a href="/A251094/b251094.txt">Table of n, a(n) for n = 1..210</a>
%F A251094 Empirical: a(n) = 7*a(n-1) - 11*a(n-2) + 10*a(n-3) - 3*a(n-4).
%F A251094 Empirical g.f.: x*(41 - 75*x + 76*x^2 - 24*x^3) / (1 - 7*x + 11*x^2 - 10*x^3 + 3*x^4). - _Colin Barker_, Nov 25 2018
%e A251094 Some solutions for n=4:
%e A251094 ..0..0..0....0..0..1....1..0..1....1..1..0....1..0..1....1..0..0....0..0..0
%e A251094 ..1..0..0....0..0..0....1..0..1....0..1..1....0..0..0....1..0..0....1..1..0
%e A251094 ..0..1..1....0..0..1....1..0..0....0..0..0....0..0..1....0..0..0....0..0..0
%e A251094 ..0..0..1....1..0..0....0..0..0....1..1..1....1..0..0....1..0..1....1..0..0
%e A251094 ..1..0..1....0..1..0....0..1..1....0..0..0....0..1..0....0..0..0....0..0..0
%Y A251094 Column 2 of A251100.
%K A251094 nonn
%O A251094 1,1
%A A251094 _R. H. Hardin_, Nov 29 2014