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 A328394 #7 Oct 16 2019 13:18:58 %S A328394 1,1,1,2,1,4,3,2,5,1,5,4,6,3,3,7,7,4,7,5,16,6,12,27,21,35,28,23,31,28, %T A328394 2,2,4,5,4,5,4,10,9,2,11,6,7,10,12,7,30,6,10,15,14,7,23,37,26,32,28, %U A328394 33,24,28,8,3,17,11,3,5,6,11,7,12,30,21,28,15,28,11,24,30,14,16,43,17,52,26,19,29,27,33,46,27,12,15,28,28,24,27,11,20,16,20 %N A328394 Maximal digit value in primorial base expansion of A276087(n): a(n) = A328114(A276087(n)). %H A328394 Antti Karttunen, <a href="/A328394/b328394.txt">Table of n, a(n) for n = 0..32768</a> %H A328394 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A328394 a(n) = A328389(A276086(n)) = A328114(A276087(n)) = A051903(A328403(n)). %t A328394 Block[{b = MixedRadix[Reverse@ Prime@ Range@ 120], f}, f[n_] := Times @@ Power @@@ # &@ Transpose@ {Prime@ Range@ Length@ #, Reverse@ #} &@ IntegerDigits[n, b]; Array[Max@ IntegerDigits[Nest[f, #, 2], b] &, 100, 0]] (* _Michael De Vlieger_, Oct 15 2019 *) %o A328394 (PARI) %o A328394 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; %o A328394 A276087(n) = A276086(A276086(n)); %o A328394 A328114(n) = { my(s=0, p=2); while(n, s = max(s,(n%p)); n = n\p; p = nextprime(1+p)); (s); }; %o A328394 A328394(n) = A328114(A276087(n)); %Y A328394 Cf. A051903, A276086, A276087, A328114, A328322, A328389, A328403. %K A328394 nonn %O A328394 0,4 %A A328394 _Antti Karttunen_, Oct 15 2019