Let Aj={i:2j−1≤ai<2j},j=1,2,…,11. The Aj form a partition of the index set {1,2,…,n}.
Note that, for every j in the range 1 through 11, if Aj is non-empty, then
i∈Aj∑ai1(a1+a2+⋯+ai)=i∈Aj∑(aia1+a2+⋯+ai−1+1)>k=0∑∣Aj∣−12jk⋅2j−1+∣Aj∣=21k=0∑∣Aj∣−1k+∣Aj∣=41∣Aj∣(∣Aj∣−1)+∣Aj∣=41∣Aj∣(∣Aj∣+3);
As the Aj form a partition of the index set {1,2,…,n} and at least one Aj is non-empty,
i=1∑nai1(a1+a2+⋯+ai)=j=1∑11i∈Aj∑ai1(a1+a2+⋯+ai)>41j=1∑11∣Aj∣(∣Aj∣+3)=41(j=1∑11∣Aj∣2+3n)≥41(11n2+3n)=441n(n+33), by Cauchy-Schwarz.