title: How to calculate sum of square of log series
body: <p>I have an algorithm, and I have figured out that its run-time complexity follows the following formula:</p>
  
  <pre><code>[log(1)]^2 + [log(2)]^2 + [log(3)]^2 + ....... + [log(n)]^2
  </code></pre>
  
  <p>The base of log is 2.</p>
  
  <p>How do I figure out what the &Theta;/&Omicron; algorithmic complexity is from this formula?</p>