Write out all the numbers, from eleven upwards. Note when you've used as many of a given digit as you've written complete numbers. For example, when you've written the first line, you'll have used two 1s - no match. But by line ten (when you write '20'), you'll have used ten 1s - match! And on the next line, another match with eleven 1s.
Do the same thing for each digit 1-9, and note the line of the n-th match for the n-th digit (eg. line 1000 is the seventh time the line number matches the number of 7s used. *)
For each digit n's nth match, add up the digits in the line number and call them A,B,C...I (eg if 28 is the second 2s match, then B=2+8=10).
Then, hey presto, the cache can be found at :
N 55 5 (4*a+d-h) . (3*h-4*b-3*d) (c+5*f-5*g) (4*f+2*g-5*a)
W 3 1 (2*c+d-h) . (4*c+b-3*a) (9*b-d+6*f) (3*f-4*c-4*g)
(If any digits work out negative, just ignore the minus-sign)
Queries to CO welcome as always.
* Not exactly 1000. But something like that.