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 A328390 #5 Oct 15 2019 17:22:12
%S A328390 0,1,1,2,1,2,1,2,1,1,1,2,1,1,1,1,1,3,1,4,2,2,1,2,2,2,4,1,1,1,1,3,2,3,
%T A328390 2,2,1,3,2,2,1,2,1,3,1,4,1,3,2,2,3,4,1,3,2,3,3,1,1,3,1,1,3,6,3,2,1,2,
%U A328390 4,4,1,5,1,1,4,3,3,2,1,5,3,2,1,4,3,2,1,4,1,4,3,3,2,3,4,2,1,2,2,4,1,3,1,5,2
%N A328390 Maximal digit value in primorial base expansion of the arithmetic derivative of n: a(n) = A328114(A003415(n)).
%H A328390 Antti Karttunen, <a href="/A328390/b328390.txt">Table of n, a(n) for n = 1..30030</a>
%H A328390 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328390 a(n) = A328114(A003415(n)).
%F A328390 a(n) = A051903(A327859(n)).
%o A328390 (PARI)
%o A328390 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A328390 A328114(n) = { my(s=0, p=2); while(n, s = max(s,(n%p)); n = n\p; p = nextprime(1+p)); (s); };
%o A328390 A328390(n) = A328114(A003415(n));
%Y A328390 Cf. A003415, A051903, A327859, A328114, A328389, A328391, A328392.
%K A328390 nonn
%O A328390 1,4
%A A328390 _Antti Karttunen_, Oct 15 2019