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.

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

Original entry on oeis.org

1049, 8812, 49872, 217634, 790734, 2510004, 7189937, 19018266, 47251067, 111715980, 253943272, 559554564, 1203154060, 2538190856, 5276700889, 10848708252, 22120797741, 44832823100, 90470607368, 182010260670
Offset: 1

Views

Author

R. H. Hardin, Dec 01 2014

Keywords

Comments

Row 5 of A251268

Examples

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

Formula

Empirical: a(n) = 13*a(n-1) -77*a(n-2) +275*a(n-3) -660*a(n-4) +1122*a(n-5) -1386*a(n-6) +1254*a(n-7) -825*a(n-8) +385*a(n-9) -121*a(n-10) +23*a(n-11) -2*a(n-12)