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 A353796 #12 May 12 2022 17:36:54
%S A353796 1,2,4,8,12,24,36,44,72,96,112,128,132,160,180,220,288,336,352,360,
%T A353796 384,396,480,528,560,640,660,880,1044,1056,1152,1232,1344,1404,1440,
%U A353796 1680,1760,1920,1980,2088,2352,2376,2464,2496,2640,3168,3600,3696,3920,4032,4400,4736,5220,5280,5376,5760,5824,6075,6144,6160
%N A353796 Numbers k such that k divides A353790(k), where A353790(n) = phi(A003973(n)) * A064989(A003973(n)).
%C A353796 Of 5263 initial terms (terms < 2^32), only 67 are odd, and of these, only two, 1 and 1525391261 (= 503^2 * 6029) are in A007310. Of 5263 initial terms, 4653 are multiples of 3, 2331 are multiples of 81, and 3780 are multiples of 5.
%H A353796 Antti Karttunen, <a href="/A353796/b353796.txt">Table of n, a(n) for n = 1..5263; all terms <= 2^32</a>
%H A353796 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A353796 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A353796 (PARI)
%o A353796 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A353796 A064989(n) = { my(f=factor(n>>valuation(n, 2))); for(i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f); };
%o A353796 A353790(n) = { my(s=sigma(A003961(n))); (eulerphi(s)*A064989(s)); };
%o A353796 isA353796(n) = !(A353790(n)%n);
%Y A353796 Cf. A000010, A000203, A003961, A003973, A353790, A353797 (subsequence).
%Y A353796 Cf. also A353795.
%K A353796 nonn
%O A353796 1,2
%A A353796 _Antti Karttunen_, May 12 2022