I've got a Python script that grinds out Amicable Pairs by trying out each integer: $i, i+1, i+2,\ldots$ . I've now found all APs with $1 \leq n \leq 65,000,000$. At this point I'm finding that it takes $24$ minutes per each additional million. To get into much larger $n$ I'll need to find a way to filter out substantial numbers of $n$ in advance. Have any been discovered?
My list of the first 202 APs: http://tutoree7.pastebin.com/dpEc0RbZ