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 A371075 #28 Aug 25 2024 22:23:56
%S A371075 12,30,80,324,448,888,11264,53248,1114112,3684352,4980736,18055168,
%T A371075 96468992
%N A371075 Fixed points of A374941.
%F A371075 Equals the ordered set {k: A374941(k) = k}.
%e A371075 12 is a term because A374941(12) = 12.
%o A371075 (PARI) f(n) = my(d=divisors(n)); sum(i=2, #d-1, if (isprime(d[i]), d[i], f(d[i])));
%o A371075 isok(k) = f(k) == k; \\ _Michel Marcus_, Mar 10 2024
%o A371075 (Python)
%o A371075 from sympy import divisors, isprime
%o A371075 from functools import cache
%o A371075 @cache
%o A371075 def f(n): return sum(di if isprime(di) else f(di) for di in divisors(n)[1:-1])
%o A371075 def ok(n): return n == f(n)
%o A371075 print([k for k in range(1, 1000) if ok(k)]) # _Michael S. Branicky_, Mar 31 2024 after _Michel Marcus_
%Y A371075 Cf. A000396, A005101, A299795, A374941.
%K A371075 nonn,more
%O A371075 1,1
%A A371075 _Tanmaya Mohanty_, Mar 10 2024
%E A371075 a(13) from _Michael S. Branicky_, Mar 31 2024