OMM 1988 Problem 4

In how many ways can one select eight integers $a_1,a_2, ... ,a_8$ , not necesarily distinct, such that $1 \le a_1 \le ... \le a_8 \le 8$ ?

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.