This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A204804 Number of free tree-like convex polyominoes with n cells. 0
 1, 1, 2, 4, 10, 21, 49, 104, 227, 468, 976, 1978, 4030, 8095, 16313, 32656 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Free: none is a rigid transformation (translation, rotation, reflection or glide reflection) of another.  Tree-like: never does a 2x2 subarrangement of squares occur in the shape. So the dual graph is a tree. Convex: every horizontal, or vertical line, meets the shape in either a single segment, or not at all. LINKS Joseph O'Rourke, MathOverflow Question: Counting restricted polyominoes, July 2011. EXAMPLE n=1: one square. n=2: a 2x1 rectangle. n=3: a 3x1 rectangle; an L-shape. So the sequence starts: 1,1,2,... Images up to n=8 at the MathOverflow link. CROSSREFS Sequence in context: A011956 A018003 A255711 * A165136 A165137 A065023 Adjacent sequences:  A204801 A204802 A204803 * A204805 A204806 A204807 KEYWORD nonn AUTHOR Joseph O'Rourke, Jan 19 2012 EXTENSIONS a(9)-a(16) from Karl Fabian, Jan 22 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.