为了解决这个问题，我们可以先编写一个函数来检查两个数是否是亲和数，然后在编写一个函数来生成Aliquot数列，并在生成每个Aliquot数时进行亲和数检查。以下是示例代码：

def is_amicable(num1, num2): divisors1 = [] divisors2 = []

for i in range(1, num1):
    if num1 % i == 0:
        divisors1.append(i)
        
for j in range(1, num2):
    if num2 % j == 0:
        divisors2.append(j)
        
return (sum(divisors1) == num2) and (sum(divisors2) == num1)

def aliquot_sequence(num): sequence = [num]

while num != 1:
    num_divisors = []
    for i in range(1, num):
        if num % i == 0:
            num_divisors.append(i)
    num = sum(num_divisors)
    
    if is_amicable(sequence[0], num):
        return []
    
    sequence.append(num)
    
return sequence

print(aliquot_sequence(1184)) # [1184, 1210, 1424, 1910, 2084, 3190, 2774, 2620, 2924, 6368, 6232, 6368]