Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052473
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052473 Binomial[2n-5,n-2]+2. +0
1
2, 2, 3, 3, 5, 12, 37, 128, 464, 1718, 6437, 24312, 92380, 352718, 1352080, 5200302, 20058302, 77558762, 300540197, 1166803112, 4537567652, 17672631902, 68923264412, 269128937222, 1052049481862, 4116715363802, 16123801841552 (list; graph; listen)
OFFSET

0,1

COMMENT

The best upper bound known for the Erdos-Szekeres problem for n >= 6.

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Sequence in context: A096010 A102330 A103403 this_sequence A165122 A051715 A143269

Adjacent sequences: A052470 A052471 A052472 this_sequence A052474 A052475 A052476

KEYWORD

nonn

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research