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.

A137191 Number of n-celled polyiamonds with perimeter < n+2.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 4, 11, 39, 120, 403, 1254, 4000, 12475, 39030
Offset: 1

Views

Author

Tanya Khovanova, Mar 03 2008

Keywords

Comments

These are n-cell polyiamonds with the perimeter less than the maximum possible one.
If we associate a graph to a polyiamond with vertices representing cells and edges representing two cells with a common edge, then this sequence enumerates polyiamonds whose corresponding graphs have cycles.

Formula