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.

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

Original entry on oeis.org

13, 169, 611, 3835, 18395, 100113, 512525, 2702193, 14044303, 73505289, 383392451, 2003126697, 10456915209, 54611619153, 285148941623, 1489042615021, 7775302008851, 40601362677837, 212010307642445, 1107075047855985
Offset: 1

Views

Author

R. H. Hardin Feb 26 2012

Keywords

Comments

Row 5 of A208420

Examples

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

Formula

Empirical: a(n) = a(n-1) +23*a(n-2) +11*a(n-3) -83*a(n-4) -21*a(n-5) +96*a(n-6) +12*a(n-7) -42*a(n-8) -2*a(n-9) +6*a(n-10)