Systematic computations on amicable numbers
Jack Alanen, Öystein Ore, Joel G. Stemple · Mathematics of Computation · 1967
have been discovered. The most recent lists are due to Escott [1], Poulet [2] and Garcia [3]. The paper by Escott contains the 390 pairs known by 1946 together with the names of their discoverers. The list of 43 pairs computed by Poulet was communicated to N. G. W. Beeger in 1941, but published only in 1948 after Poulet's death. The paper by Garcia contains 160 new pairs obtained by him and his students. These pairs have all been found by examining numbers of special forms. By combining such results Dickson [4] was able to show that up to M < 6232 there are only five amicable pairs: