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.

Previous Showing 11-13 of 13 results.

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

Original entry on oeis.org

3268, 37772, 273607, 1457326, 6247708, 22806904, 73607411, 215673388, 585010044, 1491014836, 3612638417, 8399798586, 18886662616, 41329088816, 88489078029, 186209112216, 386557846820, 794103892572, 1618422517619, 3279033220486
Offset: 1

Views

Author

R. H. Hardin, Dec 01 2014

Keywords

Comments

Row 6 of A251268

Examples

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

Formula

Empirical: a(n) = 15*a(n-1) -104*a(n-2) +442*a(n-3) -1287*a(n-4) +2717*a(n-5) -4290*a(n-6) +5148*a(n-7) -4719*a(n-8) +3289*a(n-9) -1716*a(n-10) +650*a(n-11) -169*a(n-12) +27*a(n-13) -2*a(n-14)

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

Original entry on oeis.org

10179, 161906, 1501739, 9772880, 49523566, 208452452, 760734085, 2480493084, 7386931919, 20428661228, 53150645617, 131458741458, 311732368552, 713787172312, 1587653508305, 3447998356240, 7343636929707, 15396659787782
Offset: 1

Views

Author

R. H. Hardin, Dec 01 2014

Keywords

Comments

Row 7 of A251268

Examples

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

Formula

Empirical: a(n) = 17*a(n-1) -135*a(n-2) +665*a(n-3) -2275*a(n-4) +5733*a(n-5) -11011*a(n-6) +16445*a(n-7) -19305*a(n-8) +17875*a(n-9) -13013*a(n-10) +7371*a(n-11) -3185*a(n-12) +1015*a(n-13) -225*a(n-14) +31*a(n-15) -2*a(n-16)

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

Original entry on oeis.org

11, 114, 1667, 32636, 790734, 22806904, 760734085, 28749778264, 1212060756101, 56320777311152, 2856799572599106, 156942568859096170, 9277021941286520402, 586789114650518446860, 39528041606657916420501
Offset: 1

Views

Author

R. H. Hardin, Dec 01 2014

Keywords

Comments

Diagonal of A251268

Examples

			Some solutions for n=4
..0..0..0..0..0....0..0..0..1..1....1..0..0..0..1....0..0..1..1..1
..0..0..0..0..1....1..1..1..1..1....0..1..1..1..1....0..0..0..0..1
..0..0..1..1..1....0..0..0..0..1....0..0..1..1..1....0..0..0..1..1
..0..1..0..0..1....0..0..0..1..1....0..0..0..0..0....1..1..1..1..1
..0..0..1..1..1....0..0..1..0..0....0..1..1..1..1....0..0..1..1..1
		
Previous Showing 11-13 of 13 results.