A Case Distinction on Dynamic Programming: Example Needed!
There are plenty of other examples of dynamic programming algorithms that don't fit your pattern at all.


The longest increasing subsequence problem requires only a one-dimensional table.
There are several natural dynamic programming algorithms whose tables require three or even more dimensions.  For example: Find the maximum-area white rectangle in a bitmap.  The natural dynamic programming algorithm uses a three-dimensional table.
But most importantly, dynamic programming isn't about tables; it's about unwinding recursion.  There are lots of natural dynamic programming algorithms where the data structure used to store intermediate results is not an array, because the recurrence being unwound isn't over a range of integers.  Two easy examples are finding the largest independent set of vertices in a tree, and finding the largest common subtree of two trees.  A more complex example is the $(1+\epsilon)$-approximation algorithm for the Euclidean traveling salesman problem by Arora and Mitchell.