login
A330442
The number of free polyominoes with n cells which, when drawn on a 2D square grid, contain an Eulerian path.
0
1, 1, 1, 2, 3, 6, 8, 18
OFFSET
1,4
COMMENTS
a(n) is the total number of free polyominoes containing n cells which, when drawn on a 2D square grid, contain an Eulerian path. Such polyominoes must have all edges of length one, see A245620, have one or two edges of length two with all other edges of length one, or else have one edge of length three with all other edges of length one. These edges also include those bordering internal holes.
LINKS
EXAMPLE
The one 3-cell polyomino:
+---+---+
| | |
+---+---+
| |
+---+
The two 4-cell polyominoes:
+---+---+---+ +---+---+
| | | | | | |
+---+---+---+ +---+---+---+
| | | | |
+---+ +---+---+
The three 5-cell polyominoes:
+---+---+ +---+ +---+---+
| | | | | | | |
+---+---+---+ +---+---+---+ +---+---+---+
| | | | | | | | | |
+---+---+ +---+---+---+ +---+---+
| | | | | |
+---+ +---+ +---+
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Scott R. Shannon, Dec 14 2019
STATUS
approved