OFFSET
1,3
COMMENTS
2n+2 is the maximal perimeter of an n-celled polyomino. a(n) is the number of n-celled polyominoes that have a tree as their connectedness graph (vertices of this graph correspond to cells and two vertices are connected if the corresponding cells have a common edge).
LINKS
Andrew Clarke, Isoperimetrical Polyominoes, The Poly Pages.
Herman Tulleken, Polyominoes 2.2: How they fit together, (2019).
FORMULA
a(n) >= A000602(n) [see comment on edge graph trees]. - R. J. Mathar, Mar 08 2021
CROSSREFS
KEYWORD
hard,more,nonn
AUTHOR
Tanya Khovanova, Jul 27 2007
EXTENSIONS
a(14)-a(16) from David Radcliffe, Dec 25 2017
a(17) from David Radcliffe, Dec 26 2017
a(18)-a(24) from John Mason, Dec 11 2021
STATUS
approved