The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A323759 Larger of modified exponential amicable pairs. 2
126, 378, 1260, 3780, 4584, 5544, 11424, 16632, 16728, 49308, 68760, 73962, 88608, 179118, 168730, 212160, 225096, 256338, 266568, 250920, 365700, 374304, 391656, 374418, 387720, 386568, 393528, 548550, 827700, 739620, 827652, 932100, 912288, 935400, 1052088 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A modified exponential amicable pair (m, n) has A241405(m) = A241405(n) = m + n + 1.
The lesser counterparts are in A323758.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..4725 (terms whose lesser counterparts below 2*10^11)
MATHEMATICA
f[p_, e_] := DivisorSum[e+1, p^(#-1)&]; mesigma[1]=1; mesigma[n_] := Times @@ f @@@FactorInteger@ n; s={}; mes[n_] := mesigma[n]-n; Do[m=mes[n]; If[m>n && mes[m]==n, AppendTo[s, m]], {n, 1, 10000}]; s
PROG
(PARI) f(n) = {my(f=factor(n)); prod(i=1, #f[, 1], sumdiv(f[i, 2]+1, d, f[i, 1]^(d-1))); } \\ A241405
fm(n) = f(n) - n;
isok(n) = my(fn=fm(n)); (fn > 0) && (fn < n) && (fm(fn) == n); \\ Michel Marcus, Jan 30 2019
CROSSREFS
Sequence in context: A181255 A329807 A322542 * A102805 A267556 A268119
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jan 26 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 May 13 15:16 EDT 2024. Contains 372520 sequences. (Running on oeis4.)