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 A345930 #17 Jul 30 2021 08:51:07 %S A345930 1,1,1,2,7,1,1,1,1,13,41,2,9,11,37,2,47,3,11,7,43,19,53,4,13,17,49,11, %T A345930 59,1,1,1,1,17,55,1,1,1,1,106,317,19,73,92,289,127,359,13,87,113,331, %U A345930 148,401,11,101,134,373,169,443,2,11,13,47,2,61,17,69,86,277,121,347,2,83,107,319,2,389,31,97,128,19 %N A345930 a(n) = A344756(A276086(n)). %H A345930 Antti Karttunen, <a href="/A345930/b345930.txt">Table of n, a(n) for n = 1..13860</a> %H A345930 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A345930 a(n) = A344756(A276086(n)). %F A345930 a(n) = A327860(n) / A346469(n) = A327860(n) / gcd(A327860(n), A329029(n)). %o A345930 (PARI) %o A345930 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1])); %o A345930 A069359(n) = (n*sumdiv(n, d, isprime(d)/d)); \\ From A069359 %o A345930 A344756(n) = { my(u=A003415(n)); (u/gcd(u,A069359(n))); }; %o A345930 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; %o A345930 A345930(n) = A344756(A276086(n)); %Y A345930 Cf. A003415, A069359, A276086, A327860, A329029, A344756, A346469. %Y A345930 Cf. also A342002, A346474, A346475 (compare the scatter plots). %K A345930 nonn,base,look %O A345930 1,4 %A A345930 _Antti Karttunen_, Jul 19 2021