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 A328389 #8 Oct 15 2019 17:22:29 %S A328389 1,1,1,1,1,3,2,2,2,1,2,3,4,3,2,5,2,2,4,2,5,4,5,10,6,6,8,6,5,9,1,2,3,2, %T A328389 2,4,2,2,3,1,3,3,5,4,3,5,7,4,4,8,3,3,4,9,9,8,7,11,4,8,3,3,4,4,3,4,2,2, %U A328389 3,7,10,10,5,4,6,3,8,9,7,5,10,10,10,8,5,5,8,6,9,7,4,4,6,9,4,7,8,5,3,5,7,4,7,7,11,9 %N A328389 Maximal digit value in primorial base expansion of A276086(n): a(n) = A328114(A276086(n)). %H A328389 Antti Karttunen, <a href="/A328389/b328389.txt">Table of n, a(n) for n = 0..32589</a> %H A328389 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A328389 a(n) = A328114(A276086(n)). %F A328389 a(n) = A051903(A276087(n)). %o A328389 (PARI) %o A328389 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; %o A328389 A328114(n) = { my(s=0, p=2); while(n, s = max(s,(n%p)); n = n\p; p = nextprime(1+p)); (s); }; %o A328389 A328389(n) = A328114(A276086(n)); %Y A328389 Cf. A002110, A051903, A143293, A276086, A276087, A328114, A328322, A328390, A328391, A328392, A328395. %K A328389 nonn %O A328389 0,6 %A A328389 _Antti Karttunen_, Oct 15 2019