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.

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

Original entry on oeis.org

9, 81, 297, 989, 3080, 9994, 32358, 104176, 335940, 1083914, 3495930, 11275444, 36368274, 117303034, 378351488, 1220339904, 3936101206, 12695569864, 40948497182, 132075911156, 425999751988, 1374026441136, 4431806698176
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Row 4 of A207960

Examples

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

Formula

Empirical: a(n) = a(n-1) +3*a(n-2) +11*a(n-3) +11*a(n-4) -a(n-5) -20*a(n-6) -27*a(n-7) -5*a(n-8) +20*a(n-9) +13*a(n-10) -3*a(n-11) -4*a(n-12) for n>15