title: Solving palindromic 'Triangle Quest' puzzle in Python
body: <p>I'm trying to solve this programming puzzle:</p>
  
  <blockquote>
    <p>You are given a positive integer N (0 &lt; N &lt; 10). Your task is to print a
    palindromic triangle of size N.</p>
    
    <p>For example, a palindromic triangle of size 5 is:</p>
  
  <pre><code>1
  121
  12321
  1234321
  123454321
  </code></pre>
    
    <p>You can't take more than two lines. You have to complete the code
    using exactly one print statement. </p>
    
    <p>Note: Using anything related to strings will give a score of 0. Using
    more than one for-statement will give a score of 0.</p>
  </blockquote>
  
  <p>I can think only of 'dumb' way to do this:</p>
  
  <pre><code>for i in range(1, N+1):
      print([0, 1, 121, 12321, 1234321, 123454321, 12345654321, 1234567654321, 123456787654321, 12345678987654321][i])
  </code></pre>
  
  <p>Is there a more elegant solution?</p>