login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A208357
Number of meanders of order 2n+1 (4*n+2 crossings of the infinite line) with central 1-1 cut.
0
4, 64, 1764, 68644, 3341584, 190992400, 12310790116, 871343837764, 66469126179600, 5391179227622500, 460213149486493456, 41024422751464102500, 3795407861954983718544, 362631040029370613957184, 35638591665642822414493156, 3590789985613539065908070116, 369893506453438150061450367376
OFFSET
1,1
REFERENCES
Antonios Panayotopoulos and Panos Tsikouras, Properties of meanders, JCMCC 46 (2003), 181-190.
Antonios Panayotopoulos and Panayiotis Vlamos, Meandric Polygons, Ars Combinatoria 87 (2008), 147-159.
LINKS
S. K. Lando and A. K. Zvonkin, Plane and projective meanders, Theoretical Computer Science Vol. 117, pp. 227-241, 1993.
Antonios Panayotopoulos and Panos Tsikouras, The multimatching property of nested sets, Math. & Sci. Hum. 149 (2000), 23-30.
Antonios Panayotopoulos and Panos Tsikouras, Meanders and Motzkin Words, J. Integer Seq., Vol. 7 (2004), Article 04.1.2.
Antonios Panayotopoulos and Panayiotis Vlamos, Cutting Degree of Meanders, Artificial Intelligence Applications and Innovations, IFIP Advances in Information and Communication Technology, Volume 382, 2012, pp 480-489; DOI 10.1007/978-3-642-33412-2_49. - From N. J. A. Sloane, Dec 29 2012
FORMULA
a(n) = A005315(n+1)^2.
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms using the data at A005315 added by Amiram Eldar, Jun 09 2024
STATUS
approved