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 A342466 #9 Mar 17 2021 17:59:45
%S A342466 1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,1,1,5,1,1,1,1,1,5,1,1,1,1,1,1,1,3,
%T A342466 1,11,1,1,1,11,5,1,1,5,1,1,1,1,7,23,1,1,3,1,1,1,1,11,1,5,1,1,3,1,5,1,
%U A342466 1,1,1,1,1,9,9,7,1,1,1,5,1,23,15,1,5,1,3,1,1,11,11,29,1,5,1,1,1,1,1,21,1,27,3,3,3,13,1
%N A342466 a(n) = A336466(1+A000265(sigma(n))), where A336466 is fully multiplicative with a(p) = A000265(p-1) for p prime, and A000265(k) is the odd part of k.
%H A342466 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A342466 a(n) = A336466(A336698(n)) = A336466(A337194(n)).
%F A342466 a(n) = A000265(A003958(1+A161942(n))).
%o A342466 (PARI)
%o A342466 A000265(n) = (n>>valuation(n,2));
%o A342466 A336466(n) = { my(f=factor(n)); prod(k=1,#f~,if(2==f[k,1],1,(A000265(f[k,1]-1))^f[k,2])); };
%o A342466 A337194(n) = (1+A000265(sigma(n)));
%o A342466 A342466(n) = A336466(A336698(n));
%Y A342466 Cf. A000203, A000265, A003958, A161942, A337194, A336466, A336698, A342465.
%K A342466 nonn
%O A342466 1,9
%A A342466 _Antti Karttunen_, Mar 16 2021