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 A354196 #6 May 23 2022 17:45:32
%S A354196 1,1,2,1,3,23,1,9,2,14,7,2,3,3,3,1,2,14,1,3,23,6,3,9,2,2,529,1,2,763,
%T A354196 1,7,161,161,2,2,3,21,3,483,23,3,2,7,42,109,3,2,23,2,109,3,1,69,4,6,
%U A354196 23,6,3,3,14,21,2,3133,23,6,13,2,201,161,23,126,3,2,4,1,21,109,7,3,461,21,13,23,21,75,46,12,1,8
%N A354196 a(n) = A064989(A064989(sigma(sigma(A003961(A003961(n)))))), where A003961 shifts the prime factorization of n one step towards larger primes, and A064989 shifts it back towards smaller primes.
%H A354196 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A354196 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A354196 a(n) = A064989(A354195(A003961(n))) = A064989(A064989(A051027(A003961(A003961(n))))).
%o A354196 (PARI)
%o A354196 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A354196 A064989(n) = { my(f=factor(n>>valuation(n, 2))); for(i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f); };
%o A354196 A354196(n) = A064989(A064989(sigma(sigma(A003961(A003961(n))))));
%Y A354196 Cf. A000203, A003961, A051027, A064989, A354195.
%Y A354196 Cf. also A348750.
%K A354196 nonn
%O A354196 1,3
%A A354196 _Antti Karttunen_, May 23 2022