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!)
A232538 Numbers n such that (n(n+1)/2) modulo sigma(n) = n. 2
33, 136, 145, 261, 897, 1441, 2016, 2241, 2353, 3808, 4320, 7201, 17101, 26937, 30721, 32896, 46593, 70561, 148960, 151633, 169345, 174592, 208801, 400401, 578593, 712801, 803800, 1040401, 1103233, 1596673, 2265121, 2377089, 3330001, 4357153, 5953024, 5962321 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Also numbers n such that antisigma(n) modulo sigma(n) = n. Antisigma(n) = A024816(n) = the sum of the nondivisors of n that are between 1 and n, sigma(n) = A000203(n) = the sum of the divisors of n.
Numbers n such that A232324(n) = n.
a(19) > 10^5.
LINKS
FORMULA
A232324(a(n)) = n.
EXAMPLE
136 is in sequence because antisigma(136) mod sigma(136) = 9046 mod 270 = 136.
MATHEMATICA
Select[Range[6*10^6], Mod[(#(#+1))/2, DivisorSigma[1, #]]==#&] (* Harvey P. Dale, Sep 12 2019 *)
PROG
(PARI) isok(n) = (n*(n+1)/2 - sigma(n)) % sigma(n) == n; \\ Michel Marcus, Nov 25 2013
CROSSREFS
Sequence in context: A044746 A105091 A158588 * A231758 A215962 A084028
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Nov 25 2013
EXTENSIONS
More terms from Michel Marcus, Nov 25 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:11 EDT 2024. Contains 371936 sequences. (Running on oeis4.)