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.

A251126 Number of (n+1) X (6+1) 0..1 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.

This page as a plain text file.
%I A251126 #10 Nov 26 2018 06:55:50
%S A251126 212,315,430,612,854,1214,1743,2550,3795,5747,8835,13757,21640,34309,
%T A251126 54716,87638,140804,226720,365621,590248,953577,1541325,2492185,
%U A251126 4030567,6519574,10546719,17062618,27605400,44663810,72264722,116923755
%N A251126 Number of (n+1) X (6+1) 0..1 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.
%H A251126 R. H. Hardin, <a href="/A251126/b251126.txt">Table of n, a(n) for n = 1..210</a>
%F A251126 Empirical: a(n) = 4*a(n-1) - 5*a(n-2) + a(n-3) + 2*a(n-4) - a(n-5) for n>6.
%F A251126 Empirical g.f.: x*(212 - 533*x + 230*x^2 + 255*x^3 - 183*x^4 + 10*x^5) / ((1 - x)^3*(1 - x - x^2)). - _Colin Barker_, Nov 26 2018
%e A251126 Some solutions for n=4:
%e A251126 ..0..0..0..1..0..1..1....0..0..1..0..1..0..1....0..0..0..0..1..0..1
%e A251126 ..0..0..0..1..0..0..0....0..0..1..0..1..0..1....0..0..0..0..1..0..1
%e A251126 ..0..0..0..1..0..0..0....0..0..1..0..1..0..0....0..0..0..0..1..0..1
%e A251126 ..1..0..0..1..0..0..0....0..0..1..0..1..0..0....0..0..0..0..1..0..1
%e A251126 ..1..0..0..1..0..0..0....1..1..1..0..1..0..0....1..1..1..1..1..0..0
%Y A251126 Column 6 of A251128.
%K A251126 nonn
%O A251126 1,1
%A A251126 _R. H. Hardin_, Nov 30 2014