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.
CROSSREFS
KEYWORD
hard,more,nonn
AUTHOR
Tanya Khovanova, Mar 03 2008
STATUS
approved