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.

A228682 Number of nX7 binary arrays with no two ones adjacent horizontally, diagonally or antidiagonally.

Original entry on oeis.org

34, 508, 8832, 152048, 2644336, 46125216, 806190208, 14105294112, 246929287360, 4324094979072, 75733743499264, 1326545935320192, 23236786328620160, 407043788171511808, 7130373880883372800, 124906998542616448512
Offset: 1

Views

Author

R. H. Hardin Aug 30 2013

Keywords

Comments

Column 7 of A228683

Examples

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

Formula

Empirical: a(n) = 30*a(n-1) -226*a(n-2) -108*a(n-3) +4324*a(n-4) -1612*a(n-5) -27016*a(n-6) -2240*a(n-7) +50112*a(n-8) +20032*a(n-9) -16768*a(n-10) -4864*a(n-11) +2048*a(n-12)