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.

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

Original entry on oeis.org

14180, 379440, 6182747, 71431719, 641508138, 4755605792, 30334449677, 171552528763, 879593013286, 4159202993302, 18381824623755, 76744270826567, 305302958082338, 1165526725330804, 4295151207693497, 15354987635816371
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2014

Keywords

Comments

Row 4 of A251065

Examples

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

Formula

Empirical: a(n) = 38*a(n-1) -691*a(n-2) +8006*a(n-3) -66388*a(n-4) +419576*a(n-5) -2101468*a(n-6) +8562488*a(n-7) -28910110*a(n-8) +81971700*a(n-9) -197093994*a(n-10) +404708052*a(n-11) -713198484*a(n-12) +1082053944*a(n-13) -1415611692*a(n-14) +1597131096*a(n-15) -1551815913*a(n-16) +1294677654*a(n-17) -923106107*a(n-18) +558641686*a(n-19) -284224784*a(n-20) +119985952*a(n-21) -41268128*a(n-22) +11267392*a(n-23) -2349056*a(n-24) +351232*a(n-25) -33536*a(n-26) +1536*a(n-27)