Problem #245
Sequence Triples
Let fm denote the number of sequence triples ({x0, x1, \dots, xm}, {y0, y1, \dots, ym}, {z0, z1, \dots, zm}) such that:
1\cdot x0 = y0 = z0 = 0
2\cdot Sequences xi, yi, zi are all strictly increasing
3\cdot xm + ym + zm = 4040
Then calculate \bigl( \sum_{i=1}^{\infty} fi \bigr) mod 10^{9}+7.