Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007746
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007746 Number of ways for n-3 nonintersecting loops to cross a line 2n times. +0
2
42, 640, 5894, 42840 (list; graph; listen)
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: A086944 A104901 A091962 this_sequence A030197 A020933 A030020

Adjacent sequences: A007743 A007744 A007745 this_sequence A007747 A007748 A007749

KEYWORD

nonn,hard

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research