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.

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

Original entry on oeis.org

13, 169, 621, 2200, 6766, 17763, 46199, 110732, 257118, 582114, 1274558, 2750932, 5820516, 12139129, 25026151, 50987441, 102961663, 206146550, 409655636, 808788667, 1587088299, 3097694214, 6016346686, 11632341504, 22398414558
Offset: 1

Views

Author

R. H. Hardin Feb 20 2012

Keywords

Comments

Row 5 of A207785

Examples

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

Formula

Empirical: a(n) = 5*a(n-1) -2*a(n-2) -22*a(n-3) +11*a(n-4) +73*a(n-5) -33*a(n-6) -152*a(n-7) +51*a(n-8) +205*a(n-9) -60*a(n-10) -164*a(n-11) +115*a(n-12) -148*a(n-14) +93*a(n-15) +175*a(n-16) -179*a(n-17) -6*a(n-18) +95*a(n-19) -60*a(n-20) -72*a(n-21) +129*a(n-22) -29*a(n-23) -67*a(n-24) +64*a(n-25) -19*a(n-26) -16*a(n-27) +a(n-28) +42*a(n-29) -49*a(n-30) +33*a(n-31) -17*a(n-32) +8*a(n-33) -11*a(n-34) +12*a(n-35) -8*a(n-36) +4*a(n-37) -a(n-38) for n>39