Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062346
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062346 Consider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other. +0
1
3, 45, 210, 630, 1485, 3003, 5460, 9180, 14535, 21945, 31878, 44850, 61425, 82215, 107880, 139128, 176715, 221445, 274170, 335790, 407253, 489555, 583740, 690900, 812175, 948753, 1101870, 1272810, 1462905, 1673535, 1906128, 2162160, 2443155 (list; graph; listen)
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 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research