583740domain: NAppears in sequencesConsider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other.at n=22A062346Triangular numbers that are the product of three distinct triangular numbers greater than 1.at n=36A225440