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 A328569 #15 Oct 20 2019 21:46:28
%S A328569 1,1,1,1,1,3,1,2,1,1,1,3,1,1,1,5,1,1,1,2,1,4,1,5,1,1,1,6,1,4,1,1,1,2,
%T A328569 1,1,1,2,1,1,1,3,1,1,1,5,1,4,1,2,1,3,1,9,1,1,1,4,1,1,1,1,1,4,1,2,1,2,
%U A328569 1,7,1,10,1,1,1,2,1,6,1,2,1,10,1,8,1,1,1,6,1,7,1,1,1,3,1,4,1,2,1,5,1,4,1,1,1,3
%N A328569 Exponent of least prime factor in A276086(A276086(n)), where A276086 converts the primorial base expansion of n into its prime product form.
%C A328569 Equally, the least significant nonzero digit in primorial base expansion of A276086(n).
%H A328569 Antti Karttunen, <a href="/A328569/b328569.txt">Table of n, a(n) for n = 0..32768</a>
%H A328569 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328569 a(n) = A276088(A276086(n)) = A067029(A276087(n)).
%F A328569 max(a(n),1+A051903(A328400(A003557(A276086(A328476(n)))))) = A328389(n). [A328400 is optional in the formula]
%F A328569 For all even n, a(n) < A328579(n).
%o A328569 (PARI)
%o A328569 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328569 A276088(n) = { my(e=0, p=2); while(n && !(e=(n%p)), n = n/p; p = nextprime(1+p)); (e); };
%o A328569 A328569(n) = A276088(A276086(n));
%Y A328569 Cf. A003557, A051903, A067029, A276086, A276087, A276088, A328389, A328400, A328476, A328570, A328579.
%K A328569 nonn
%O A328569 0,6
%A A328569 _Antti Karttunen_, Oct 20 2019