2075647domain: NAppears in sequencesNumbers x such that x = Sum_{i=1..k} (x mod d_(x+i)) for some k, where d_(x+i) is the aliquot parts of (x+i).at n=16A290469a(n) is the maximum number of strong sub-tournaments in an n-tournament.at n=21A386875