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 A322319 #8 Dec 05 2018 17:23:48 %S A322319 1,3,4,6,6,12,8,12,12,18,12,12,14,24,24,24,18,12,20,18,32,36,24,12,30, %T A322319 42,36,24,30,72,32,48,48,54,48,12,38,60,56,36,42,96,44,36,24,72,48,24, %U A322319 56,90,72,42,54,36,72,24,80,90,60,72,62,96,96,96,84,144,68,54,96,144,72,12,74,114,120,60,96,168,80,72 %N A322319 a(n) = lcm(A003557(n), A048250(n)). %H A322319 Antti Karttunen, <a href="/A322319/b322319.txt">Table of n, a(n) for n = 1..10000</a> %H A322319 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a> %F A322319 a(n) = lcm(A003557(n), A048250(n)). %F A322319 a(n) = A001615(n) / A322318(n). %t A322319 a[n_] := If[n == 1, 1, Module[{f=FactorInteger[n]}, LCM[ Times@@ (First[#] ^(Last[#]-1)& /@ f), Times@@((#+1)& @@@ f)]]]; Array[a, 120] (* _Amiram Eldar_, Dec 05 2018 *) %o A322319 (PARI) %o A322319 A003557(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557 %o A322319 A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1])); %o A322319 A322319(n) = lcm(A048250(n), A003557(n)); %Y A322319 Cf. A001615, A003557, A048250, A322318. %Y A322319 Cf. also A322321, A322359. %K A322319 nonn %O A322319 1,2 %A A322319 _Antti Karttunen_, Dec 05 2018