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 A342672 #9 Mar 23 2021 16:17:13
%S A342672 1,3,20,63,42,60,88,135,325,126,156,1260,238,264,840,2511,342,975,460,
%T A342672 126,1760,468,696,540,1519,714,1000,5544,930,2520,1184,1701,3120,1026,
%U A342672 3696,20475,1558,1380,4760,1890,1806,5280,2068,3276,13650,2088,2544,50220,6897,4557,6840,14994,3186,3000,6552,11880,1840,2790
%N A342672 a(n) = lcm(sigma(n), A003961(n)), where A003961 is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors of n.
%H A342672 Antti Karttunen, <a href="/A342672/b342672.txt">Table of n, a(n) for n = 1..8192</a>
%H A342672 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A342672 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A342672 a(n) = lcm(A000203(n), A003961(n)).
%F A342672 a(n) = A341529(n) / A342671(n).
%o A342672 (PARI)
%o A342672 A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A342672 A342672(n) = lcm(sigma(n), A003961(n));
%Y A342672 Cf. A000203, A003961, A341529, A342671.
%K A342672 nonn
%O A342672 1,2
%A A342672 _Antti Karttunen_, Mar 20 2021