Finding all the combinations

local tbl = {"List of Combinations"}

local combos = io.open("combos.txt", "w")

for a = 0, 65 do
    A = (1.15 ^ a) - 1
    for b = 0, 52 do
        B = A + ((20/3) * ((1.15 ^ b) - 1))
        if (B > 10000) then break end
        for c = 0, 40 do
            C = B + ((100/3) * ((1.15 ^ c) - 1))
            if (C > 10000) then break end
            for d = 0, 28 do
                -- flush the table here, usually contains ~500 items!
                if tbl[1] ~= nil then
                    combos:write("\n")
                end
                combos:write(table.concat(tbl, "\n"))
                tbl = {}
                D = C + ((200) * ((1.15 ^ d) - 1))
                if (D > 10000) then break end
                for e = 0, 19 do
                    E = D + ((2000/3) * ((1.15 ^ e) - 1))
                    if (E > 10000) then break end
                    for f = 0, 11 do
                        F = E + ((8000/3) * ((1.15 ^ f) - 1))
                        if (F > 10000) then break end
                        for g = 0, 4 do
                            G = F + ((40000/3) * ((1.15 ^ g) - 1))
                            if G < 10000 and (10000 - G) < (15*(1.15 ^ (a+1)))/100 and (10000 - G) < (100*(1.15 ^ (b+1)))/100 and (10000 - G) < (500*(1.15 ^ (c+1)))/100 and (10000 - G) < (3000*(1.15 ^ (d+1)))/100 and (10000 - G) < (10000*(1.15 ^ (e+1)))/100 and (10000 - G) < (40000*(1.15 ^ (f+1)))/100 and (10000 - G) < (200000*(1.15 ^ (g+1)))/100 then
                                table.insert(tbl, string.format("%d, %d, %d, %d, %d, %d, %d", a, b, c, d, e, f, g))
                            end
                        end
                    end
                end
            end
        end
    end
end

combos:close()