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 A336458 #11 Jun 15 2021 14:55:29
%S A336458 1,2,3,6,28,40,84,120,135,224,270,496,672,819,1488,1638,3780,8128,
%T A336458 10880,24384,30240,32640,32760,66960,167400,174592,406224,523776,
%U A336458 1097280,2178540,3138345,6276690,6517665,6656832,8910720,10480640,13035330,14705145,17428320,23569920,29410290,31441920,33550336
%N A336458 Numbers k for which A065330(k) = A065330(sigma(k)).
%C A336458 Numbers k for which A065330(k) = A336457(k).
%C A336458 Question: Is this a subsequence of A336461?
%H A336458 <a href="/index/O#opnseqs">Index entries for sequences where odd perfect numbers must occur, if they exist at all</a>
%t A336458 Select[Range[10^5], SameQ @@ Map[Times @@ Map[#1^#2 & @@ # &, DeleteCases[ FactorInteger[#], _?(First@ # <= 3 &)]] &, {#, DivisorSigma[1, #]}] &, 97] (* _Michael De Vlieger_, Jul 24 2020 *)
%Y A336458 Cf. A000203, A065330, A336457.
%Y A336458 Cf. A336461.
%Y A336458 Subsequences: A000396, A005820.
%K A336458 nonn
%O A336458 1,2
%A A336458 _Antti Karttunen_, Jul 24 2020