login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007746 Number of ways for n-3 nonintersecting loops to cross a line 2n times. 1
42, 640, 5894, 42840 (list; graph; refs; listen; history; internal format)
OFFSET

4,1

REFERENCES

S. K. Lando and A. K. Zvonkin "Plane and projective meanders", Theoretical Computer Science Vol. 117, pp. 227-241, 1993.

LINKS

P. Di Francesco, O. Golinelli and E. Guitter, Meanders: a direct enumeration approach, Nucl. Phys. B 482 [ FS ] (1996) 497-535.

FORMULA

4(2n)!/[3(n-4)!(n+6)! ] * (n^4+20n^3+107n^2-107n+15).

CROSSREFS

A diagonal of triangle A008828.

Sequence in context: A196671 A104901 A091962 * A200853 A159947 A030197

Adjacent sequences:  A007743 A007744 A007745 * A007747 A007748 A007749

KEYWORD

nonn,hard

AUTHOR

Philippe Di Francesco (philippe(AT)amoco.saclay.cea.fr)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.