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 A328582 #5 Oct 21 2019 19:28:48
%S A328582 1,1,1,1,2,2,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,6,6,4,4,4,4,4,4,1,1,1,1,
%T A328582 2,2,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,6,6,4,4,4,4,4,4,2,2,2,2,2,2,2,2,
%U A328582 2,2,2,2,2,2,2,2,2,2,6,6,6,6,6,6,4,4,4,4,4,4,3,3,3,3,6,6,3,3,3,3,6,6,6,6,6,6
%N A328582 Least common multiple of nonzero digits in primorial base expansion of n.
%C A328582 a(0) = 1 as an empty product.
%H A328582 Antti Karttunen, <a href="/A328582/b328582.txt">Table of n, a(n) for n = 0..32768</a>
%H A328582 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%H A328582 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328582 a(n) = A072411(A276086(n)).
%o A328582 (PARI) A328582(n) = { my(m=1, p=2); while(n, if(n%p, m = lcm(m,n%p)); n = n\p; p = nextprime(1+p)); (m); };
%Y A328582 Cf. A072411, A276086, A328581.
%Y A328582 Cf. A276156 (positions of 1's).
%K A328582 nonn
%O A328582 0,5
%A A328582 _Antti Karttunen_, Oct 21 2019