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.

A162678 Number of fixed strictly disconnected n-ominoes bounded (not necessarily tightly) by an n*n square.

Original entry on oeis.org

0, 2, 42, 937, 26427, 937126, 40290848, 2036152559, 118202398712, 7747410863508, 565695467280668, 45525704815211707, 4002930269942820774, 381750656962679848234, 39244733577786597223238
Offset: 1

Views

Author

David Bevan, Jul 28 2009

Keywords

Comments

a(n) = A162676(n) - A001168(n)

Examples

			a(2)=2: the two rotations of the disconnected domino consisting of two squares connected at a vertex
		

Crossrefs