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 A324202 #16 Dec 10 2023 17:54:01 %S A324202 1,2,2,6,2,12,2,30,6,12,2,120,2,12,12,210,2,180,2,420,12,12,2,2520,6, %T A324202 12,30,420,2,720,2,2310,12,12,12,7560,2,12,12,9240,2,720,2,420,120,12, %U A324202 2,138600,6,180,12,420,2,6300,12,60060,12,12,2,151200,2,12,420,30030,12,720,2,420,12,720,2,831600,2,12,180,420,12,720,2,360360 %N A324202 a(n) = A046523(A332461(n)), where A332461(n) = Product_{d|n, d>1} prime(1+A297167(d)). %H A324202 Antti Karttunen, <a href="/A324202/b324202.txt">Table of n, a(n) for n = 1..8192</a> %H A324202 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %F A324202 a(n) = A046523(A332461(n)). %F A324202 A001221(a(n)) = A324190(n). %F A324202 A001222(a(n)) = A032741(n). %o A324202 (PARI) %o A324202 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523 %o A324202 A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1]))); %o A324202 A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1)); %o A324202 A324202(n) = A046523(factorback(apply(x -> prime(1+x),apply(A297167, select(d -> d>1,divisors(n)))))); %Y A324202 Cf. A032741, A061395, A297113, A297167, A324190, A324203 (rgs-transform), A324537, A332461. %K A324202 nonn %O A324202 1,2 %A A324202 _Antti Karttunen_, Feb 19 2019