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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126162 Number of unitary amicable pairs (i,j) with i<j and i<=10^n. 0
0, 0, 1, 2, 7, 19, 78, 185, 454, 1095, 2552, 6105 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
Pedersen J. M., Known amicable pairs.
FORMULA
The number of integer pairs (m,n) with m<n for which usigma(m)=usigma(n)=m+n.
EXAMPLE
a(7)=78 because there are 78 unitary amicable pairs with m<=10^7
MATHEMATICA
UnitaryDivisors[n_Integer?Positive] := Select[Divisors[n], GCD[ #, n/# ] == 1 \ &]; sstar[n_] := Plus @@ UnitaryDivisors[ n] - n; UnitaryAmicableNumberQ[k_] := If[Nest[sstar, k, 2] == k && ! sstar[k] == k, True, False]; UnitaryAmicablePairList[ k_] := (anlist = Select[Range[k], UnitaryAmicableNumberQ[ # ] &]; prlist = \ Table[Sort[{anlist[[n]], sstar[anlist[[ n]]]}], {n, 1, Length[anlist]}]; data = Union[prlist, prlist]); UnitaryAmicablePairList[10^7]; Table[Length[Select[data, First[ # ] < \ 10^k &]], {k, 1, 7}]
CROSSREFS
Cf. A034448.
Sequence in context: A243279 A362097 A080873 * A054423 A137990 A056650
KEYWORD
hard,nonn
AUTHOR
Ant King, Dec 20 2006
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 December 3 19:10 EST 2023. Contains 367540 sequences. (Running on oeis4.)