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 A336844 #8 Aug 06 2020 23:27:48
%S A336844 1,1,1,7,1,1,1,3,1,1,1,5,5,1,1,61,3,1,1,7,5,1,1,1,29,5,5,5,1,1,5,23,
%T A336844 11,3,1,101,11,1,7,3,3,5,1,23,1,1,7,91,67,29,1,59,1,5,1,1,5,1,1,5,9,5,
%U A336844 47,547,5,11,5,33,23,1,19,39,3,11,43,5,11,7,11,61,391,3,23,59,3,1,1,9,25,1,7,49,29,7,1,137
%N A336844 a(n) = A336698(A003961(n)).
%H A336844 Antti Karttunen, <a href="/A336844/b336844.txt">Table of n, a(n) for n = 1..16383</a>
%H A336844 Antti Karttunen, <a href="/A336844/a336844.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A336844 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A336844 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A336844 a(n) = A000265(1+A000265(A003973(n))).
%F A336844 a(n) = A336698(A003961(n)) = A336699(A003961(n)).
%o A336844 (PARI)
%o A336844 A000265(n) = (n>>valuation(n,2));
%o A336844 A003973(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); sigma(factorback(f)); };
%o A336844 A336844(n) = A000265(1+A000265(A003973(n)));
%Y A336844 Cf. A000265, A000203, A003961, A003973, A336698, A336699, A336842.
%K A336844 nonn
%O A336844 1,4
%A A336844 _Antti Karttunen_, Aug 06 2020