login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A232538
Numbers n such that (n(n+1)/2) modulo sigma(n) = n.
3
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
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.
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
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Nov 25 2013
EXTENSIONS
More terms from Michel Marcus, Nov 25 2013
STATUS
approved