Find romantic (amicable) numbers

romantic_numbers.py

#!/usr/bin/env python3
# -*- coding: utf-8 -*-

def get_divisors(n):
    divisors = []
    for i in range(1, int(n / 2) + 1):
        if n % i == 0:
            divisors.append(i)
    return divisors

if __name__ == "__main__":
    romantic_numbers = []    
    for n in range(10, 100000 + 1):
        n1 = sum(get_divisors(n))
        n2 = sum(get_divisors(n1))

        if n == n2 and n != n1:
            romantic_numbers.append(n)
            if n1 not in romantic_numbers:
                print(f'{n} and {n1}')