def antidivisor_count(n):

    n = as_int(abs(n))
    if n <= 2:
        return 0
    return divisor_count(2*n-1) + divisor_count(2*n+1) + \
        divisor_count(n) - divisor_count(n, 2) - 5
Return the number of antidivisors [1]_ of ``n``.
dataset/ETHPy150Open sympy/sympy/sympy/ntheory/factor_.py/antidivisor_count