login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015630 Augmented amicable pairs (larger member of each pair). 7
11697, 16005, 28917, 76245, 339825, 570405, 871585, 697851, 678376, 1340865, 2067625, 1823925, 1483785, 1899261, 2479065, 2580105, 4895241, 4740505, 5736445, 3171556, 4791916, 6516237, 4416976, 7524525, 9868075, 7589745 (list; graph; refs; listen; history; text; internal format)
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

Cf. A007992.

Sequence in context: A254723 A031631 A250923 * A237933 A251347 A234863

Adjacent sequences:  A015627 A015628 A015629 * A015631 A015632 A015633

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 24 03:39 EST 2020. Contains 338607 sequences. (Running on oeis4.)