This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A045768 Numbers n such that sigma(n) == 2 (mod n). 26
 1, 20, 104, 464, 650, 1952, 130304, 522752, 8382464, 134193152, 549754241024, 8796086730752 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Equivalently, Chowla function of n is congruent to 1 mod n. If p=2^i-3 is prime, then 2^(i-1)*p is a member of the sequence. 650 is in the sequence, but is not of this form. For 1 < n <= 134193152 this sequence has the property that if sigma(n)==2 (mod n) then sigma(n)==0 (mod n+1). It is not known if this holds in general, for there might be solutions of sigma(n)=3n+2 or 4n+2 or ... (Comments from Jud MccCranie and Dean Hickerson). n | sigma(n) produces the multiperfect numbers (A007691). It is an open question whether n | sigma(n) - 1 iff n is a prime or 1. It is not known if there exist solutions to sigma(n) = 2n+1. Sequence gives also the nonprime solutions to sigma(n)==0 (mod n+1 ) n>1 - Benoit Cloitre, Feb 05 2002 Sequence seems to give nonprime n such that the numerator of the sum of the reciprocals of the divisors of n equals n+1 (nonprime n such that A017665(n)=n+1). - Benoit Cloitre, Apr 04 2002 a(12) > 10^12. - Donovan Johnson, Mar 01 2012 For n > 1, composite numbers n such that A108775(n) = floor(sigma(n)/n) = sigma(n) mod n = A054024(n). Complement of primes (A000040) with respect to A230606. There are not numbers k > 2 such that sigma(x) = k*(x+1) has a solution. - Jaroslav Krizek, Dec 05 2013 a(13) > 10^13. - Giovanni Resta, Apr 02 2014 REFERENCES R. K. Guy, Unsolved Problems in Number Theory, B2. LINKS Amitabha Tripathi, A note on products of primes that differ by a fixed integer, Fibonacci Quart. 48 (2010), no. 2, 144-149. EXAMPLE sigma(650) = 1302 == 2 mod 650. MATHEMATICA Do[If[Mod[DivisorSigma[1, n]-2, n]==0, Print[n]], {n, 1, 10^8}] Join[{1}, Select[Range[8000000], Mod[DivisorSigma[1, #], #]==2 &]] (* Vincenzo Librandi, Mar 11 2014 *) PROG (PARI) is(n)=sigma(n)%n==2 || n==1 \\ Charles R Greathouse IV, Mar 09 2014 CROSSREFS n such that A054013(n)=1. Cf. A050414, A050415, A054024, A045769, A088834, A045770, A076496. Sequence in context: A241355 A220207 A189950 * A088831 A063785 A181703 Adjacent sequences:  A045765 A045766 A045767 * A045769 A045770 A045771 KEYWORD nonn AUTHOR EXTENSIONS More terms from Jud McCranie, Dec 22 1999. He says there are no other terms < 4290000000. a(11) from Donovan Johnson, Mar 01 2012 a(12) from Giovanni Resta, Apr 02 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.