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.

A207721 Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.

Original entry on oeis.org

22, 484, 5302, 66946, 820820, 10150118, 125165018, 1545006848, 19064074106, 235267721766, 2903258039792, 35827609743354, 442126584439650, 5456029684316684, 67329644638468630, 830875800786510138
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Row 6 of A207717

Examples

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

Formula

Empirical: a(n) = 8*a(n-1) +63*a(n-2) -85*a(n-3) -424*a(n-4) +387*a(n-5) +724*a(n-6) -695*a(n-7) -148*a(n-8) +185*a(n-9) +13*a(n-10) -14*a(n-11) -a(n-12)