1037520

Appears in sequences

• Number of ways of placing n non-attacking bishops on an n X n board so that every square is attacked (or occupied).at n=12A005635
• Triangular numbers which are 9-almost primes.at n=22A076583
• Triangular numbers that can be represented as a sum of two distinct triangular numbers, and as a product of two triangular numbers greater than 1.at n=27A295768