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.

A207502 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.

Original entry on oeis.org

14, 196, 932, 3939, 14253, 41938, 122061, 319798, 813724, 2009628, 4807523, 11399943, 26611726, 61691519, 142452960, 327544544, 752851062, 1729196533, 3973096971, 9138133990, 21035634301, 48483600980, 111872215076, 258410783006
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Row 5 of A207500

Examples

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

Formula

Empirical: a(n) = 5*a(n-1) -a(n-2) -24*a(n-3) +99*a(n-5) -2*a(n-6) -235*a(n-7) -24*a(n-8) +372*a(n-9) +59*a(n-10) -396*a(n-11) +66*a(n-12) +186*a(n-13) -280*a(n-14) -50*a(n-15) +588*a(n-16) -124*a(n-17) -524*a(n-18) +148*a(n-19) +326*a(n-20) -212*a(n-21) -80*a(n-22) +226*a(n-23) -98*a(n-24) -116*a(n-25) +70*a(n-26) +86*a(n-27) -87*a(n-28) +21*a(n-29) +13*a(n-30) -4*a(n-31) -20*a(n-32) +17*a(n-33) -4*a(n-34) -a(n-35) +2*a(n-37) -a(n-38)