OFFSET
1,1
COMMENTS
Let f(n) = 1 + sum of aliquot divisors of n; these are pairs (n,m) with f(n)=m, f(m)=n.
The terms of the sequence are sorted in the order of the smaller (omitted) member of each pair. [Harvey P. Dale, Feb 29 2012]
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1159
D. Moews, Augmented amicable pairs
J. O. M. Pedersen, Tables of Aliquot Cycles [Broken link]
J. O. M. Pedersen, Tables of Aliquot Cycles [Via Internet Archive Wayback-Machine]
J. O. M. Pedersen, Tables of Aliquot Cycles [Cached copy, pdf file only]
P. Pollack, Quasi-Amicable Numbers are Rare, J. Int. Seq. 14 (2011) # 11.5.2
MATHEMATICA
aap[n_]:=Module[{p=Total[Most[Divisors[n]]]+1}, If[p!=n&&n==Total[Most[ Divisors[p]]]+1, {p, n}, 0]]; Transpose[Union[Sort/@DeleteCases[aap/@ Range[10000000], 0]]][[2]] (* Harvey P. Dale, Feb 29 2012 *)
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
STATUS
approved