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 A073045 #12 Dec 05 2019 10:20:34
%S A073045 4,9,25,27,49,121,125,169,289,343,361,529,625,841,961,1331,1369,1681,
%T A073045 1849,2197,2209,2401,2809,3125,3481,3721,4489,4913,5041,5329,6241,
%U A073045 6859,6889,7921,9409,10201,10609,11449,11881,12167,12769,14641,16129,16807
%N A073045 Nonprime solutions to sopfr(n) = S(n), where sopfr(n) = A001414 and S(n) = A002034.
%H A073045 Amiram Eldar, <a href="/A073045/b073045.txt">Table of n, a(n) for n = 1..10000</a>
%e A073045 sopfr(9) = S(9) = 6 and 6 is composite, so 9 is a term.
%o A073045 (PARI) {for(n=1,17000,if(!isprime(n),s=0; fac=factor(n); for(i=1,matsize(fac)[1],s=s+fac[i,1]*fac[i,2]); m=1; p=1; while(p%n>0,m++; p=p*m); if(s==m,print1(n,","))))}
%Y A073045 Cf. A001414, A002034, A074583.
%K A073045 nonn
%O A073045 1,1
%A A073045 _Jason Earls_, Aug 24 2002
%E A073045 Edited and extended by _Klaus Brockhaus_, Aug 26 2002