前n个数的最大奇数除数之和

def get_largest_odd_divisor_sum(n):
    largest_odd_divisor_sum = 0
    for i in range(1, n+1):
        largest_odd_divisor = 1
        for j in range(1, i+1):
            if i % j == 0 and j % 2 != 0:
                largest_odd_divisor = j
        largest_odd_divisor_sum += largest_odd_divisor
    return largest_odd_divisor_sum

n = 10
result = get_largest_odd_divisor_sum(n)
print("前", n, "个数的最大奇数除数之和为：", result)