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 A336837 #10 Aug 17 2020 20:51:37
%S A336837 0,1,2,14,3,9,5,17,44,13,6,32,8,21,23,284,9,163,11,137,37,25,14,105,
%T A336837 30,33,86,73,15,81,18,547,44,37,53,1622,20,45,58,149,21,129,23,260,
%U A336837 401,57,26,1662,230,109,65,114,29,297,63,237,79,61,30,263,33,73,213,4010,83,153,35,383,100,183,36,1715,39,81
%N A336837 Numerator of ratio A336841(n)/A000005(n).
%H A336837 Antti Karttunen, <a href="/A336837/b336837.txt">Table of n, a(n) for n = 1..16384</a>
%H A336837 Antti Karttunen, <a href="/A336837/a336837.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A336837 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A336837 a(n) = A336841(n) / A336856(n) = A336841(n) / gcd(A000005(n), A336841(n)).
%o A336837 (PARI)
%o A336837 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A336837 A336841(n) = ((numdiv(n)*A003961(n)) - sigma(A003961(n)));
%o A336837 A336837(n) = numerator(A336841(n)/numdiv(n));
%Y A336837 Cf. A000005, A003961, A003973, A336838, A336841, A336856.
%Y A336837 Cf. A336839 (denominators).
%K A336837 nonn,frac
%O A336837 1,3
%A A336837 _Antti Karttunen_, Aug 07 2020