Hi fags, I'm the guy in previous threads concerned not about cool stuff, but the fundamental efficiency of reaching the correct cells. So with that in mind, I've been looking at {0:n:d:x:1:c^2}, because in a factoring situation, we don't have a, b, or n, but we do have c and c^2.
There seems to be an efficiently discoverable pattern in {0:n:d:x:1:c^2}. Let's take a 3, b 3, c 9 simply because it appears on the downloadable spreadsheets and .png files for The End. c^2 81.
Now let's look through column 0 for "1:81}", and you'll find {0:32:9:8:1:81}. This can be quickly constructed via the general pattern {0:n:c:c - 1:1:c^2}. You can solve for n = ((a + b) / 2) - d. For this case:
n = ((81 + 1) / 2) - 9
n = (82 / 2) - 9
n = 41 - 9
n = 32
So, we can immediately construct a starting point, here {0:32:9:8:1:81}. Now search column 0 for ":81}". You will find:
{0:2:63:14:49:81}
{0:8:45:20:25:81}
{0:18:27:18:9:81}
{0:32:9:8:1:81}
[cont]