Let e(m) be the sum of all values of k satisfying the equation: (m mod k = floor((m - k)/k) mod k), minus 2*m (1 <= k <= m); then a(n) is the smallest m for which e(m) = n, or 0 if no e(m) has value n.

A374870

Let e(m) be the sum of all values of k satisfying the equation: (m mod k = floor((m - k)/k) mod k), minus 2*m (1 <= k <= m); then a(n) is the smallest m for which e(m) = n, or 0 if no e(m) has value n.