#SEARCH OF UNTOUCHABLE AMICABLE NUMBERS
#We want to search them between 1 and z
#Note that those untouchable amicable pairs only are even numbers because odd numbers have a lot of aliquot antecedents
z=1000000
#First we search all the even amicable pairs between 1 and z
#It is possible that one member of a pair is smaller than z and the other is bigger than z
amis=[]
i=2
while i<=z:
a=sigma(i)-i
if sigma(a)-a==i and a!=i:
if i not in amis:
amis.append(i)
amis.append(a)
i=i+2
#We put all those numbers in a two dimension array so we can associate those numbers with their number of aliquot antecedents
amistab=[]
l=len(amis)
tt=l+2
i=0
while i<=tt:
amistab.append([0,0])
i=i+1
c=1
while c<=l:
amistab[c][0]=amis[c-1]
c=c+1
#We have to search the greater element of the list amis
max=0
i=0
while i