|
| |
|
|
A200000
|
|
Number of meanders filling out an n-by-n grid, reduced for symmetry.
|
|
4
|
| |
|
|
|
OFFSET
|
1,4
|
|
|
COMMENTS
|
The sequence counts the distinct 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 not considered distinct.
Are a(1) and a(2) the only two terms equal to 1? And is a(3) the only term equal to 0? - Daniel Forgues, Nov 24 2011
The answer is yes: There are several patterns that can straightforwardly be generalized to any grid of any size n>3, like e.g., #13 and #6347 of the graphics for a(6) (resp. #24 or #28 of a(5) for odd n). - M. F. Hasler, Nov 24 2011
a(10) = 31194475941824888769. - Alex Chernov, May 28 2012
|
|
|
LINKS
|
Table of n, a(n) for n=1..8.
Dale Gerdemann, Video illustration for a(5) = 42
OEIS Wiki, Number of meanders filling out an n-by-n grid (reduced for symmetry)
Jon Wild, Illustration for a(4) = 4
Jon Wild, Illustration for a(5) = 42
Jon Wild, Illustration for a(6) = 9050 [Warning: this is a large file!]
|
|
|
EXAMPLE
|
a(1) counts the paths that visit the single cell of the 1-by-1 lattice: there is one, the "fat dot".
The 4 solutions for n=4, 42 solutions for n=5 and 9050 solutions for n=6 are illustrated in the supporting png files.
|
|
|
CROSSREFS
|
Cf. A200749 (version not reduced for symmetry).
Cf. A200893 (meanders on n-by-k rectangles instead of squares, reduced for symmetry)
Cf. A201145 (meanders on n-by-k rectangles, not reduced for symmetry)
Sequence in context: A134356 A156479 A111829 * A198209 A220774 A186678
Adjacent sequences: A199997 A199998 A199999 * A200001 A200002 A200003
|
|
|
KEYWORD
|
nonn,nice,more
|
|
|
AUTHOR
|
Jon Wild, Nov 20 2011
|
|
|
EXTENSIONS
|
a(8) and a(10) from Alex Chernov, May 28 2012
|
|
|
STATUS
|
approved
|
| |
|
|
