login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A137191
Number of n-celled polyiamonds with perimeter < n+2.
0
0, 0, 0, 0, 0, 1, 1, 4, 11, 39, 120, 403, 1254, 4000, 12475, 39030
OFFSET
1,8
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
CROSSREFS
Sequence in context: A355888 A203161 A050987 * A106269 A126758 A149258
KEYWORD
hard,more,nonn
AUTHOR
Tanya Khovanova, Mar 03 2008
STATUS
approved