dp[i][j]=dp[j][k]+1 where a[j]*2=a[i]+a[k] can be done using a loop.
via: http://www.geeksforgeeks.org/length-of-the-longest-arithmatic-progression-in-a-sorted-array
time O(n^2) space O(n^2)