TH-TMO 2004 Problem 10

Find the number of ways to select three distinct numbers from ${1, 2, . . . , 3n}$ with a sum divisible by $3$ .

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.