login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A323759
Larger of modified exponential amicable pairs.
3
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
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
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jan 26 2019
STATUS
approved