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.

A188712 Number of 8Xn binary arrays without the pattern 0 0 diagonally or vertically.

Original entry on oeis.org

55, 1681, 54049, 1729531, 55337580, 1769780565, 56585607231, 1808994829500, 57829148027161, 1848624216954643, 59094629276262316, 1889063777872100973, 60387214464117233335, 1930382199629976832828, 61708017083116822627729
Offset: 1

Views

Author

R. H. Hardin Apr 08 2011

Keywords

Comments

Row 8 of A188706

Examples

			Some solutions for 8X3
..1..1..0....0..1..1....1..1..1....0..1..1....1..1..0....0..0..1....0..1..0
..1..1..1....1..1..0....0..0..0....1..1..0....1..0..1....1..1..1....1..1..1
..1..0..0....1..1..1....1..1..1....1..1..1....0..1..1....0..1..0....0..0..1
..1..1..1....1..0..1....0..1..0....0..0..1....1..1..1....1..1..1....1..1..1
..1..0..0....0..1..1....1..1..1....1..1..1....0..1..1....1..0..0....1..1..1
..1..1..1....1..1..1....1..1..1....1..0..1....1..1..0....1..1..1....1..1..1
..1..0..1....0..1..1....1..1..1....1..1..1....1..0..1....0..0..0....1..1..1
..0..1..1....1..1..0....1..0..1....0..1..1....0..1..1....1..1..1....1..0..0
		

Formula

Empirical: a(n) = 55*a(n-1) -933*a(n-2) +7094*a(n-3) -27502*a(n-4) +57434*a(n-5) -65257*a(n-6) +38535*a(n-7) -10341*a(n-8) +900*a(n-9) for n>11