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 A101051 #14 Sep 25 2021 09:32:42
%S A101051 2,9,25,121,132,169,343,361,841,1369,2809,3481,3721,4489,4913,6889,
%T A101051 10201,11449,16371,17161,19321,22201,26569,29791,29929,32041,32761,
%U A101051 38809,44521,51529,72361,79507,85849,100489,120409,121801,139129,143641
%N A101051 Numbers m such that Sum_{p prime|m} p^r(p) = m, where r(p) is the least positive primitive root of p (A001918).
%C A101051 Most terms m of the sequence have k = omega(m) = 1, only 132 and 16371 with k=3 are found. Further searches did not find any more terms with k >= 3. k has to be odd in any case, this can be easily seen by looking at the parity of the prime factors. Perhaps someone with a stronger computer can find more numbers with k>1, if there are any. [There are no other terms that are not prime powers among the first 1000 terms. - _Amiram Eldar_, Sep 25 2021]
%H A101051 Amiram Eldar, <a href="/A101051/b101051.txt">Table of n, a(n) for n = 1..1000</a>
%e A101051 16371 = 3^2 * 17 * 107 = 3^2 + 17^3 + 107^2.
%t A101051 f[p_, e_] := p^PrimitiveRoot[p]; q[n_] := Plus @@ f @@@ FactorInteger[n] == n; Select[Range[2, 10^5], q] (* _Amiram Eldar_, Sep 25 2021 *)
%Y A101051 Cf. A001918.
%K A101051 nonn
%O A101051 1,1
%A A101051 _Sven Simon_, Nov 28 2004
%E A101051 Shorter name from _Amiram Eldar_, Sep 25 2021