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.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A291881 Numbers n such that sigma(sigma(n)) = sigma(sigma(n)-n) + sigma(n); that is, f(g(n)) = g(f(n)) where f = A000203 and g = A001065. 1
 2, 38040, 51888, 236644, 260880, 3097024, 5283852, 5667312, 11777472, 46120848, 52981252, 69128640, 121352208, 330364848, 485906400, 662736600, 769422720, 1111869360, 1267978320, 1272335760, 1426817904, 1807128528, 2107406448, 2381691312, 2452404544, 2691587568 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Initial motivation for this sequence was that question: Can be an odd number k such that f(g(k)) = g(f(k)) where f = A000203 and g = A001065? Non-abundant terms are 2, 236644, 52981252,... If an odd term exists, it is larger than 2*10^11. - Giovanni Resta, Sep 15 2017 LINKS Table of n, a(n) for n=1..26. EXAMPLE 38040 is a term because sigma(38040) = 114480 and sigma(114480) = sigma(76440) + 114480. MATHEMATICA inQ[n_] := DivisorSigma[1, DivisorSigma[1, n]] == DivisorSigma[1, DivisorSigma[1, n] - n] + DivisorSigma[1, n]; (* Robert G. Wilson v, Sep 10 2017 *) PROG (PARI) a001065(n) = sigma(n)-n; isok(n) = sigma(a001065(n))==a001065(sigma(n)); CROSSREFS Cf. A000203, A001065, A051027, A072869. Sequence in context: A206854 A330304 A272166 * A257968 A303738 A055578 Adjacent sequences: A291878 A291879 A291880 * A291882 A291883 A291884 KEYWORD nonn AUTHOR Altug Alkan, Sep 05 2017 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.

Last modified May 18 15:59 EDT 2024. Contains 372664 sequences. (Running on oeis4.)