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.

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

Original entry on oeis.org

2911, 134456, 6204344, 286298344, 13211127617, 609622239024, 28130774228952, 1298083303266168, 59899533694064023, 2764039970645608136, 127545516428291433088, 5885536726506369363688, 271585732913285543900561
Offset: 1

Views

Author

R. H. Hardin, Nov 28 2014

Keywords

Comments

Column 5 of A250956

Examples

			Some solutions for n=2
..1..1..0..0..0..1....0..0..0..0..1..1....1..1..0..1..1..0....0..1..1..0..1..1
..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..1..1..1....1..1..1..0..0..1
..0..1..0..1..1..0....1..1..1..1..1..1....1..1..1..1..0..1....1..0..1..1..0..0
		

Formula

Empirical: a(n) = 57*a(n-1) -516*a(n-2) +637*a(n-3) +2799*a(n-4) -3639*a(n-5) -100*a(n-6) +429*a(n-7)