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.

A030445 Number of one-sided n-celled polyknights.

Original entry on oeis.org

1, 2, 8, 68, 550, 5328, 52484, 534793, 5513338, 57494308, 604212943, 6392547793, 68014392915
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.

Examples

			The 2 polyknights with 2 cells:
  X.. ..X
  ..X X..
The 8 polyknights with 3 cells:
  X. X.. X.. X... X.X .X. .X. X...
  .. ... ..X .... ... X.. ..X ...X
  .X .X. ... .X.. .X. ..X X.. .X..
  .. ... .X. ...X
  X. ..X
		

Crossrefs

Extensions

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