The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229114 Numbers k such that antisigma(k) mod k = antisigma(k+1) mod (k+1). 0
 1, 8, 27, 3115, 3451, 4725, 10611, 15951, 20155, 27643, 74875, 2767675, 18390564, 27923284, 50293331, 425018875, 897002491, 10561657872, 15193530235, 20939306635, 40882585915, 80585844499 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Antisigma(k) = A024816(k) = sum of numbers less than k which do not divide k. Numbers k such that A229110(k) = A229110(k+1). For k < 10^8, 2 is the only number such that sigma(k) mod k = sigma(k+1) mod (k+1). a(23) > 10^11. - Donovan Johnson, Sep 27 2013 LINKS Table of n, a(n) for n=1..22. EXAMPLE a(3) = 27 because antisigma(27) mod 27 = 338 mod 27 = antisigma(28) mod 28 = 350 mod 28 = 14. PROG (PARI) s=1; r=0; for(n=1, 10^9, n1=n+1; s=s+n1; r1=(s-sigma(n1))%n1; if(r==r1, print(n)); r=r1) /* Donovan Johnson, Sep 27 2013 */ CROSSREFS Cf. A024816 (antisigma(n)), A229110 (antisigma(n) mod n). Sequence in context: A115701 A030483 A027454 * A088029 A126815 A053619 Adjacent sequences: A229111 A229112 A229113 * A229115 A229116 A229117 KEYWORD nonn,more AUTHOR Jaroslav Krizek, Sep 26 2013 EXTENSIONS a(12)-a(22) from Donovan Johnson, Sep 27 2013 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 December 3 01:39 EST 2023. Contains 367526 sequences. (Running on oeis4.)