login
A390204
Number of {4,5} polyominoes of size n for which there exists at least one closed path that passes through each square exactly once.
1
0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 1, 0, 7, 2, 1, 26, 16, 5, 128
OFFSET
1,11
COMMENTS
This sequence was calculated in the context of a project in collaboration with Érika Roldán, and Rosemberg Toalá-Enríquez.
CROSSREFS
Sequence in context: A187197 A375368 A174869 * A330862 A269158 A109971
KEYWORD
nonn,more
AUTHOR
John Mason, Nov 03 2025
STATUS
approved