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.

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

Original entry on oeis.org

40545, 6588344, 1068793208, 173396103624, 28130774228952, 4563772381621072, 740399698245965774, 120118108984608820672, 19487258188664690627928, 3161498585197751785301512, 512903006004112848693757874
Offset: 1

Views

Author

R. H. Hardin, Nov 28 2014

Keywords

Comments

Column 7 of A250956.

Examples

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

Crossrefs

Cf. A250956.

Formula

Empirical: a(n) = 217*a(n-1) -9657*a(n-2) +124578*a(n-3) +170544*a(n-4) -10015311*a(n-5) +58649394*a(n-6) -123233697*a(n-7) -48475236*a(n-8) +586861054*a(n-9) -648215662*a(n-10) -98069529*a(n-11) +412774803*a(n-12) -157024008*a(n-13) -1439235*a(n-14) +9306900*a(n-15) -1445850*a(n-16).