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.

A207940 Number of 4Xn 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 1 0 vertically.

Original entry on oeis.org

8, 64, 200, 643, 2422, 9430, 38207, 156792, 649758, 2703377, 11276024, 47088326, 196773391, 822559178, 3439147214, 14380613647, 60135069834, 251472698220, 1051624711847, 4397789612658, 18391203655144, 76910735347923
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Row 4 of A207938

Examples

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

Formula

Empirical: a(n) = 7*a(n-1) -6*a(n-2) -42*a(n-3) +62*a(n-4) +91*a(n-5) -149*a(n-6) -91*a(n-7) +138*a(n-8) +42*a(n-9) -50*a(n-10) -7*a(n-11) +6*a(n-12) for n>13