A390204 - OEIS

%I #5 Nov 09 2025 19:34:24

%S 0,0,0,0,1,0,0,1,0,0,2,1,0,7,2,1,26,16,5,128

%N Number of {4,5} polyominoes of size n for which there exists at least one closed path that passes through each square exactly once.

%C This sequence was calculated in the context of a project in collaboration with Érika Roldán, and Rosemberg Toalá-Enríquez.

%Y Cf. A119611, A361288.

%K nonn,more

%O 1,11

%A _John Mason_, Nov 03 2025