OFFSET
1,1
COMMENTS
I proved the following facts: (a) If (m,n) is a unitary amicable pair such that mod(m,4)= mod(n,4)=2 and 5 doesn't divide m*n then (10*m,10*n) is a unitary amicable pair. (b) If (m,n) is a unitary amicable pair such that m/12 and n/12 are natural numbers and gcd(m/12,12)=gcd(n/12,12)=1 then (3/2*m,3/2*n) is a unitary amicable pair. - Farideh Firoozbakht, Nov 27 2005
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. D. Noe, Table of n, a(n) for n = 1..7896 (from Pedersen's website)
Peter Hagis, Jr., Unitary amicable numbers, Math. Comp., 25 (1971), 915-918.
J. M. Pedersen, Known Unitary 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]
Ivars Peterson, Amicable Pairs, Divisors, and a New Record, January 30 2004.
Eric Weisstein's World of Mathematics, Unitary Amicable Number.
EXAMPLE
(114,126) is a unitary amicable pair: 114 has unitary divisors 1, (2,57), (3,38) and (6,19), apart from 114 itself. Their sum is 126, whose unitary divisors < 126 are 1, (2,63), (7,18), (9,14) whose sum is 114.
MATHEMATICA
uDivisors[n_] := Select[Divisors[n], # < n && GCD[#, n/#] == 1 & ]; mate[n_] := If[m = Total[uDivisors[n]]; n == Total[uDivisors[m]], m, 0]; Reap[Do[If[n < mate[n], Print[n]; Sow[n]], {n, 2, 2000000}]][[2, 1]] (* Jean-François Alcover, Jun 12 2012 *)
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
N. J. A. Sloane; extended Nov 24 2005
STATUS
approved