* Choose 6 different numbers from $1,2, \cdots, 49$, where at least two are consecutive. How many ways are there to do this?
Let $a_{1}<a_{2}<\cdots<a_{6}$ be chosen from $1,2, \cdots, 49$. If $a_{1}, \cdots, a_{6}$ are not adjacent, then $a_{1}<a_{2}-1<a_{3}-2<\cdots<a_{6}-5$ are 6 different numbers chosen from $1,2, \cdots, 44$, with a total of $\mathrm{C}_{44}^{6}$ ways of choosing.
Therefore, the number of ways that satisfy the condition is $\mathrm{C}_{49}^{6}-\mathrm{C}_{44}^{6}$.