This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A337162 #31 Mar 24 2021 12:36:51
%S A337162 1,6,840,3420
%N A337162 Numbers m such that Sum_{d|m: 1<=d<=sqrt(m)} m/d-d is a multiple of m.
%C A337162 Integers m such that A079667(m) is a multiple of m.
%C A337162 Sum_{d|m: 1<=d<=sqrt(m)} (m/d)-d = 0 only when m=1 and Sum_{d|m: 1<=d<=sqrt(m)} (m/d)-d = m only when m=6.
%C A337162 If m is q+1-perfect and 2*Sum_{d|m: 1<=d<=sqrt(m)} d=m then Sum_{d|m: 1<=d<=sqrt(m)} (m/d)-d = m*q or if m is member of this sequence i.e. Sum_{d|m: 1<=d<=sqrt(m)} (m/d)-d = m*q and 2*Sum_{d|m: 1<=d<=sqrt(m)} d=m then m is q+1-perfect.
%C A337162 Does there exist any m apart from 6 which is q+1-perfect, q>=2 and satisfies 2*Sum_{d|m: 1<=d<=sqrt(m)} d=m? Because if it exists then m is member of this sequence.
%t A337162 Select[Range[10^5], Function[m, Mod[DivisorSum[m, Abs[m/# - #] &, # <= Sqrt[m] &], m] == 0]] (* _Michael De Vlieger_, Mar 17 2021 *)
%o A337162 (PARI) isok(m) = !(sumdiv(m, d, if (d^2 <= m, m/d-d)) % m); \\ _Michel Marcus_, Jan 28 2021
%Y A337162 Cf. A079667, A007691 (in comment).
%K A337162 nonn,more
%O A337162 1,2
%A A337162 _Devansh Singh_, Jan 28 2021