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 A328915 #11 Oct 30 2019 19:56:10
%S A328915 1,3,5,3,7,15,11,3,5,21,13,15,17,33,35,3,19,15,23,21,55,39,29,15,7,51,
%T A328915 5,33,31,105,37,3,65,57,77,15,41,69,85,21,43,165,47,39,35,87,53,15,11,
%U A328915 21,95,51,59,15,91,33,115,93,61,105,67,111,55,3,119,195,71,57,145,231
%N A328915 If n = Product (p_j^k_j) then a(n) = Product (nextprime(p_j)), where nextprime = A151800.
%C A328915 All terms are odd.
%H A328915 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A328915 If n = Product (p_j^k_j) then a(n) = Product (prime(pi(p_j) + 1)), where pi = A000720.
%F A328915 a(n) = A007947(A003961(n)).
%e A328915 a(12) = a(2^2 * 3) = a(prime(1)^2 * prime(2)) = prime(2) * prime(3) = 3 * 5 = 15.
%p A328915 a:= n-> mul(nextprime(i[1]), i=ifactors(n)[2]):
%p A328915 seq(a(n), n=1..100); # _Alois P. Heinz_, Oct 30 2019
%t A328915 a[1] = 1; a[n_] := Times @@ (NextPrime[#[[1]]] & /@ FactorInteger[n]); Table[a[n], {n, 1, 70}]
%o A328915 (PARI) a(n) = my(f=factor(n)); prod(k=1, #f~, nextprime(f[k,1]+1)); \\ _Michel Marcus_, Oct 30 2019
%Y A328915 Cf. A000720, A003961, A007947, A045965, A045967, A048250, A151800, A328878, A328879.
%K A328915 nonn,mult
%O A328915 1,2
%A A328915 _Ilya Gutkovskiy_, Oct 30 2019