|
%I #22 Dec 16 2021 22:48:55
%S 11697,16005,28917,76245,339825,570405,871585,697851,678376,1340865,
%T 2067625,1823925,1483785,1899261,2479065,2580105,4895241,4740505,
%U 5736445,3171556,4791916,6516237,4416976,7524525,9868075,7589745
%N Augmented amicable pairs (larger member of each pair).
%C Let f(n) = 1 + sum of aliquot divisors of n; these are pairs (n,m) with f(n)=m, f(m)=n.
%C The terms of the sequence are sorted in the order of the smaller (omitted) member of each pair. [_Harvey P. Dale_, Feb 29 2012]
%H Amiram Eldar, <a href="/A015630/b015630.txt">Table of n, a(n) for n = 1..1159</a>
%H D. Moews, <a href="http://djm.cc/augmented.fmtlist">Augmented amicable pairs</a>
%H J. O. M. Pedersen, <a href="http://amicable.homepage.dk/tables.htm">Tables of Aliquot Cycles</a> [Broken link]
%H J. O. M. Pedersen, <a href="http://web.archive.org/web/20140502102524/http://amicable.homepage.dk/tables.htm">Tables of Aliquot Cycles</a> [Via Internet Archive Wayback-Machine]
%H J. O. M. Pedersen, <a href="/A063990/a063990.pdf">Tables of Aliquot Cycles</a> [Cached copy, pdf file only]
%H P. Pollack, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL14/Pollack/pollack3.html">Quasi-Amicable Numbers are Rare</a>, J. Int. Seq. 14 (2011) # 11.5.2
%t 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 *)
%Y Cf. A007992.
%K nonn,nice
%O 1,1
%A _N. J. A. Sloane_
|
