Closed paths that visit every cell of an -by- rectangular lattice at least once, that never cross any edge between adjacent squares more than once, and are self-avoiding. Paths related by rotation and/or reflection of the square lattice are considered distinct.

Comment from Jon Wild: further entries in the sequence indicate that it continues to match A078008. I do not know how to prove it, but Benoît Jubin, writing on the seqfan email list (Nov 22 2011), said it was not difficult to prove.

Would you please ask Benoît Jubin to add the proof to this wiki page. — Daniel Forgues 05:15, 28 November 2011 (UTC)

Meanders filling out an n-by-n grid (not reduced for symmetry)

Meanders filling out an n-by-n grid, not reduced for symmetry:

Closed paths that visit every cell of an n-by-n square lattice at least once, that never cross any edge between adjacent squares more than once, and that do not self-intersect. Paths related by rotation and/or reflection of the square lattice are considered distinct.

For the n-by-n grid, we need to solve cells. For each cell, there are up to 8 tiles to choose from, giving possible (valid or invalid) configurations.