sniffnoy | Really, what does any of this have to do with powers of 2?

So I've been thinking about what I've doing as being working on the 2^a3^b problem, but in fact powers of 2 don't seem to enter much into it. I think I should be able to take this stuff (once I've properly proved the regularities in g_r(k), I mostly know how but I haven't done all of it - and actually I still haven't checked that they're good enough) and prove something of the form "For all numbers n not of the following forms, [list of forms], f(n)≥[something bigger than 3log_3(n)]". Depends how good the numbers are, though.

-Harry