Summation with Ceilinged Logarithmic Function According to Johann Blieberger's paper - "Discrete Loops and Worst Case Performance" (1994):
$$
\sum_{i = 1}^{n}\left \lceil \log_2{(i)} \right \rceil = n\left \lceil \log_2{(n)} \right \rceil - 2^{\left \lceil \log_2{(n)} \right \rceil} + 1
$$
Now, I was wondering if someone knows what the following may equal?
$$
\sum_{i = 1}^{n}i\left \lceil \log_2{(i)} \right \rceil = ?
$$

I could come with a solution with an incisive precision for any base a by doing this:
$$
\\
T(n) = \sum_{i= 1}^{n}i\left \lceil \log_a(i) \right \rceil  = \left[\sum_{i= 1}^{\left \lfloor \log_a(n) \right \rfloor}i \left(\sum_{j = a^{i - 1} + 1}^{a^i} j\right)\right] + \left \lceil \log_a(n) \right \rceil\sum_{i = a^{\left \lfloor \log_a(n) \right \rfloor} + 1}^{n}i
\\
T(n) = \left[\frac{1}{2}\sum_{i= 1}^{\left \lfloor \log_a(n) \right \rfloor}i \left(a^{i - 2}(a -1)(a^{i + 1} + a^i + a)\right)\right] + \left \lceil \log_a(n) \right \rceil\sum_{i = a^{\left \lfloor \log_a(n) \right \rfloor} + 1}^{n}i
\\
\text{Let  }
T_1(n) = \left[\frac{1}{2}\sum_{i= 1}^{\left \lfloor \log_a(n) \right \rfloor}i \left(a^{i - 2}(a -1)(a^{i + 1} + a^i + a)\right)\right]
\\
\text{And  }
T_2(n) = \left \lceil \log_a(n) \right \rceil\sum_{i = a^{\left \lfloor \log_a(n) \right \rfloor} + 1}^{n}i
\\
T_1(n) = \frac{1}{2(a^2 - 1)}\left((-1 - \left \lfloor \log_a(n) \right \rfloor)a^{2\left \lfloor \log_a(n) \right \rfloor} - a^{\left \lfloor \log_a(n) \right \rfloor + 1} + \left \lfloor \log_a(n) \right \rfloor a^{\left \lfloor \log_a(n) \right \rfloor+ 2} + \left \lfloor \log_a(n) \right \rfloor a^{2\left \lfloor \log_a(n) \right \rfloor+ 2} - (\left \lfloor \log_a(n) \right \rfloor + 1)a^{\left \lfloor \log_a(n) \right \rfloor} + a + 2 \right) 
\\
T_2(n) = \frac{\left \lceil \log_a(n) \right \rceil(n - a^{\left \lfloor \log_a(n) \right \rfloor})(a^{\left \lfloor \log_a(n) \right \rfloor} + n + 1)}{2}
\\\\
\text{Therefore }
T(n) = T_1(n) + T_2(n)
$$
