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 A328584 #6 Oct 21 2019 19:28:59 %S A328584 0,2,6,6,36,90,30,70,120,90,90,990,300,650,1050,150,3600,7650,2250, %T A328584 4750,1500,5250,24750,51750,15000,1250,48750,33750,157500,326250,210, %U A328584 434,672,462,2142,630,1260,2590,3990,2730,2520,25830,1050,15050,23100,3150,72450,148050,42000,12250,5250,89250,409500,834750,236250 %N A328584 Least common multiple of n and A276086(n). %H A328584 Antti Karttunen, <a href="/A328584/b328584.txt">Table of n, a(n) for n = 0..10000</a> %H A328584 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a> %H A328584 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A328584 a(n) = lcm(n, A276086(n)). %F A328584 a(n) = A324580(n) / A324198(n). %o A328584 (PARI) %o A328584 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; %o A328584 A328584(n) = lcm(n, A276086(n)); %o A328584 (PARI) %o A328584 A006530(n) = if(n>1, vecmax(factor(n)[, 1]), 1); \\ From A006530. %o A328584 A328584(n) = if(!n,n,my(m=1, p=2, orgn=n, maxp = A006530(n)); while(n || (p<=maxp), m *= (p^max(n%p, valuation(orgn, p))); n = n\p; p = nextprime(1+p)); (m)); %Y A328584 Cf. A276086, A324198, A324580. %K A328584 nonn %O A328584 0,2 %A A328584 _Antti Karttunen_, Oct 21 2019