TADM2E 2.33
From Algorithm Wiki
Revision as of 14:42, 2 March 2015 by Ccamenares (talk | contribs)
On careful observation , one can see that the sum of any row is just $ 3^<sup>(n-1)</sup> $ this is the sum for the series . This can even be computed using a series as shown below
1=a0 1 1 1 a1 a0 a2
now a(mid) of the next line becomes the a(0) +a(1) +a(2) that it this mid element is always the sum of the middle three elements
