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.

A030446 Number of n-celled polyknights (polyominoes connected by knight's moves).

Original entry on oeis.org

1, 1, 6, 35, 290, 2680, 26379, 267598, 2758016, 28749456, 302120154, 3196299285, 34007337629
Offset: 1

Views

Author

Keywords

Comments

A polyknight is a variant of a polyomino in which two tiles a knight's move apart are considered adjacent. A polyknight need not be connected in the sense of a polyomino.
These are free polyknights.

Crossrefs

Extensions

Corrected and extended by Joseph Myers, May 21 2004
a(12)-a(13) from John Mason, Jan 13 2023