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 A354872 #8 Jun 12 2022 22:53:19 %S A354872 1,1,1,1,3,1,1,1,4,1,1,1,1,5,1,1,5,1,5,3,2,1,5,1,7,1,3,1,6,1,1,7,8,7, %T A354872 1,1,9,2,1,1,7,1,7,7,10,1,3,1,7,9,2,1,7,4,7,5,11,1,7,1,12,1,1,3,8,1,3, %U A354872 11,8,1,7,1,13,2,5,9,9,1,7,1,14,1,2,5,15,3,2,1,8,5,11,13,16,11,7,1,9,3,2,1,10 %N A354872 a(n) = A056239(n) / gcd(A056239(n), A258851(n)). %C A354872 Numerator of fraction A056239(n) / A258851(n). %H A354872 Antti Karttunen, <a href="/A354872/b354872.txt">Table of n, a(n) for n = 2..65537</a> %H A354872 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %F A354872 a(n) = A056239(n) / A354871(n) = A056239(n) / gcd(A056239(n), A258851(n)). %o A354872 (PARI) %o A354872 A056239(n) = { my(f); if(1==n, 0, f=factor(n); sum(i=1, #f~, f[i, 2] * primepi(f[i, 1]))); } %o A354872 A258851(n) = (n*sum(i=1, #n=factor(n)~, n[2, i]*primepi(n[1, i])/n[1, i])); \\ From A258851 %o A354872 A354872(n) = { my(u=A056239(n)); (u/gcd(u, A258851(n))); }; %o A354872 \\ Or: %o A354872 A354872(n) = numerator(A056239(n)/A258851(n)); %Y A354872 Cf. A056239, A258851, A278510, A354871, A354873 (denominators). %K A354872 nonn,frac %O A354872 2,5 %A A354872 _Antti Karttunen_, Jun 11 2022