Consider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other.
A062346
Consider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other.
Terms
- a(0) =3a(1) =45a(2) =210a(3) =630a(4) =1485a(5) =3003a(6) =5460a(7) =9180a(8) =14535a(9) =21945a(10) =31878a(11) =44850a(12) =61425a(13) =82215a(14) =107880a(15) =139128a(16) =176715a(17) =221445a(18) =274170a(19) =335790a(20) =407253a(21) =489555a(22) =583740a(23) =690900a(24) =812175a(25) =948753a(26) =1101870a(27) =1272810a(28) =1462905a(29) =1673535
External references
- oeis: A062346