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!)
A084306 Numbers x such that sigma(x) mod x = 12 and x is not divisible by 6. Singular solutions mentioned in A076496. 4
121, 304, 127744, 33501184, 8589082624 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
If n = P*q, where P is a multiple perfect number and q is prime so that gcd(P,q) = 1, then sigma(n) = kn(q+1). Consequently sigma(n) = knq + kn sigma(n) mod n = kn. Such values of n are regular solutions to this and analogous cases. Here, not these but the additional eccentric solutions are collected. Cf. A076496.
a(6) > 10^11. - Donovan Johnson, Sep 20 2012
If p = 2^k - 13 > 3 is a prime number, then 2^(k-1)*p is a term. This happens for k = 5, 9, 13, 17, 57, 105, 137, 3217, ... (A096818). - Giovanni Resta, Apr 01 2014
LINKS
EXAMPLE
n = 33501184 = 4096*8179; sigma(n) = 2n + 12 = 67002380.
MATHEMATICA
Do[s=Mod[DivisorSigma[1, n], n]; If[IntegerQ[n/100000], Print[{n}]]; If[Equal[s, 12]&&!Equal[Mod[n, 6], 0], Print[n]], {n, 1, 100000000}]
CROSSREFS
Sequence in context: A038467 A106562 A106573 * A254978 A254971 A112075
KEYWORD
nonn
AUTHOR
Labos Elemer, Jun 11 2003
EXTENSIONS
a(5) from Donovan Johnson, Sep 20 2012
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 June 7 12:16 EDT 2024. Contains 373173 sequences. (Running on oeis4.)