OFFSET
1,3
COMMENTS
Apparently the cells are circular blobs which must be connected diagonally and the polyominoes can be rotated by 90 degrees and turned over.
Also the number of essentially different (i.e., not related by reflections, translations or rotations) diagrams consisting of n nodes in Z^2 and n-1 horizontal or vertical edges of length 1 between pairs of nodes such that the resulting graph is connected (hence a tree). - Paul Boddington, Jul 27 2004
They are thus equivalent to a subset of the polyedges, counted by A019988, i.e., those that are treelike. - John Mason, Aug 20 2021
The number of treelike polyedges with n edges is a(n+1). - John Mason, Feb 12 2023
LINKS
R. J. Mathar, Table of all such polyominoes with n <= 10 cells (gzipped)
R. J. Mathar, C++ program
Douglas A. Torrance, Enumeration of planar Tangles, arXiv:1906.01541 [math.CO], 2019-2020. See Table 4.1 (C).
M. Vicher, Polyforms
M. Vicher, The 15 5-celled diagonal polyominoes
M. Vicher, The 15 5-celled diagonal polyominoes
FORMULA
EXAMPLE
The diagonal polyominoes with 1, 2, 3 and 4 cells are
O O O O O
\ \ \ /
O O O
\
O
O O O O O O
\ \ \ / \ / /
O O O O O O O
\ / \ \ / /
O O O O O
\ \
O O
CROSSREFS
KEYWORD
nonn,nice,more
AUTHOR
James A. Sellers, Aug 28 2000
EXTENSIONS
Description revised by N. J. A. Sloane, Jun 21 2001
a(10) from R. J. Mathar, Apr 10 2006
a(11) from Douglas A. Torrance, Mar 06 2020
a(12)-a(14) from John Mason, Aug 14 2021
a(15)-a(19) from John Mason, Jun 01 2023
STATUS
approved