login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126163 Number of super unitary amicable pairs (i,j) with i<j and i<=10^n. 0
0, 1, 8, 27, 102, 375, 1134, 3589, 11942, 40410 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Super unitary amicable pairs
FORMULA
Integer pairs (m,n) with m<n and for which usigma(usigma(m))=usigma(usigma(n))=m+n.
EXAMPLE
a(6)=375 because there are 375 super unitary (m,n) pairs with m<n and for which m<=10^6
MATHEMATICA
UnitaryDivisors[n_Integer?Positive] := Select[Divisors[n], GCD[ #, n/# ] == 1 \ &];
UnitaryDivisorSum[n_Integer?Positive] := Plus @@ UnitaryDivisors[n];
f[ k_] := Nest[UnitaryDivisorSum, k, 2] - k;
g[ k_] := Nest[UnitaryDivisorSum, f[k], 2] - f[k];
m = 10^7;
data1 = Select[Range[m], g[ # ] == # &];
data2 = Nest[UnitaryDivisorSum, #, 2] - # & /@ data1;
data3 = Table[{data1[[k]], data2[[k]]}, {k, 1, Length[data1]}];
data4 = DeleteCases[Table[If[Nest[UnitaryDivisorSum, First[data3[[k]]], 2] == Nest[UnitaryDivisorSum, Last[data3[[k]]], 2] \ && ! First[data3[[k]]] >= Last[data3[[k]]], data3[[k]], 0], {k, 1, Length[data3]}], 0];
data5 = Table[Length[Select[data4, First[ # ] < 10^k \ &]], {k, 1, 7}]
CROSSREFS
Sequence in context: A079712 A056598 A343283 * A307117 A331285 A183316
KEYWORD
hard,nonn,more
AUTHOR
Ant King, Dec 20 2006
EXTENSIONS
a(8)-a(10) from Amiram Eldar, Feb 18 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 22:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)