Please fill in the entire summations for lines 4 through 9 and just the total for line 1,000,000.
1.
1 = 1
2.
14 = 2 + 12
3.
41 = 2 + 3 + 13 + 23
4.
? = ? + ? + ? + . . .
5.
? = ? + ? + ? + . . .
6.
? = ? + ? + ? + . . .
7.
? = ? + ? + ? + . . .
8.
? = ? + ? + ? + . . .
9.
? = ? + ? + ? + . . .
1,000,000.
? = (no need for the series of terms
if you’re not in the mood)
The right side of each summation produces the minimum possible total from a series of unique numbers whose digits include one 1, two 2s, three 3s, and so on up to the line’s number.   Here are two straightforward approaches that produce non-minimal totals, as less than 111 is possible for line 4.
4.
111 = 1 + 2 + 3 + 4 + 23 + 34 + 44
4.  
223334445 = 1 + 223334444
Beyond line 9, digits equivalent to 10 and more are in play for the summed terms, but digit positions have powers- of-10 values as usual.   Nothing here requires actual depiction of digits greater than 9 but, to clarify, a non-minimal line 10 might use [10] to represent the digit 10 like this.
- 122333444455555666666777777788888900111111109
=
122333444455555666666777777788888888999999999
+   [10][10][10][10][10][10][10][10][10][10]
=
122333444455555666666777777788888888999999999
+ 10×1000000000
+ 10×100000000
+ 10×10000000
+ 10×1000000
+ 10×100000
+ 10×10000
+ 10×1000
+ 10×100
+ 10×10
+ 10
= 122333444455555666666777777788888888999999999 + 11111111110
no-computers solutions should receive more approval than computed solutions, which would have value nonetheless as cross checks.
This puzzle was motivated by Two missing numbers.