I think the real problem, as you said, is having a copy of the full sequence around for encoding and decoding, and finding any given string of bits within it.
Furthermore, I would guess the offset has even less entropy on average than the bitsequence you're hoping to compress, so if you had an algorithm that would shorten the expression of the offset you might very well be able to apply it to the original bitsequence with the same or better results.
I'd think an information theory expert could probably tackle these sorts of questions very rigorously, but I am not one so this is mostly conjecture.
Namely that there are 2^n possible signals with n bits, so if a compression algorithm compresses some signal that is larger than n bits down to n bits or less, then there aren't enough possibilities left for all possible signals of at most n to also be encoded with n bits or less.
However, you'll still find that there are still limits to exactly how much you can compress things. And you'll find that, sometimes when you think you've found something that looks like it should be able to compress things down to nothing, that you've just been hiding the data in your decompression program.
In a sense, when you consider special-purpose compression and decompression functions, it's not unlike how "RETR some_huge_file.rar" sent to an FTP program will "decompress" that tiny string into some multi-GB file. But that only works because the program already has a copy of the data.
The first problem with that is finding the desired content somewhere in the number. You can't just Google it. In fact, I know of no way to search for it except for brute force (i.e. continue to calculate pi until such time as you find it). Because the odds are so low for any reasonably sized file, this is going to take a long time. Even if you measure using a scale where one unit is the current age of the universe, you would find the scale to be too small.
Even if someone solves that problem, the other problem is file size. You have to store offset and length. The length for most files would be reasonable, the problem is the offset. In all probability, that number is larger than your original file. Much larger. There are exceptions, of course, but not enough of them to help.
That said, I wonder how long it will be before some mathematician starts writing theorems about the "set of illegal numbers" like the 09F9 number and the rest.