import math


def _find_candidate_lengths_mul(lst):
    """Return integer lengths n, n*1.1, n*1.2, ... n*1.9, n*2"""
    n = len(lst)
    r = [ int(math.ceil((1 + x/10.0)*n)) for x in range(0,11)]
    # avoid duplicates
    s = set()
    for a in r:
        # we avoid length 1 tables for hashmul since they throw away
        # all the bits and should really use the linear hash function
        # stuff.
        if a > 1:
            s.add(a)
    return sorted(list(s))