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.

A240786 Number of 5Xn 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.

Original entry on oeis.org

16, 111, 459, 2167, 10150, 47920, 226532, 1071982, 5074441, 24028807, 113785341, 538857251, 2551907524, 12085420318, 57234822524, 271056496272, 1283688860005, 6079388685605, 28791225250367, 136351659911471, 645744522623364
Offset: 1

Views

Author

R. H. Hardin, Apr 12 2014

Keywords

Comments

Row 5 of A240783

Examples

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

Formula

Empirical: a(n) = 10*a(n-1) -35*a(n-2) +50*a(n-3) +23*a(n-4) -204*a(n-5) +114*a(n-6) +684*a(n-7) -1284*a(n-8) -309*a(n-9) +4412*a(n-10) -5481*a(n-11) -90*a(n-12) +4826*a(n-13) -3964*a(n-14) -3408*a(n-15) +3143*a(n-16) +3475*a(n-17) -3191*a(n-18) +7943*a(n-19) +2119*a(n-20) +1380*a(n-21) -8241*a(n-22) -8523*a(n-23) +3733*a(n-24) -79*a(n-25) +1925*a(n-26) +1275*a(n-27) +131*a(n-28) -147*a(n-29) -286*a(n-30) for n>34