cp's OEIS Frontend

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.

A328392 Maximal digit value in primorial base expansion of A327860(n): a(n) = A328114(A327860(n)).

This page as a plain text file.
%I A328392 #10 Oct 16 2019 13:18:48
%S A328392 0,1,1,2,1,3,1,1,1,1,1,4,2,2,4,6,1,3,2,2,4,5,6,7,3,7,10,7,6,9,1,1,2,2,
%T A328392 3,5,2,4,2,1,3,4,3,5,2,6,9,4,3,10,3,6,8,2,8,5,7,7,5,10,2,2,3,4,2,6,4,
%U A328392 2,6,9,3,4,4,5,6,9,6,7,5,7,9,5,11,10,4,3,5,11,16,7,4,3,5,2,5,6,5,7,4,6,8,10,5,9,12,11
%N A328392 Maximal digit value in primorial base expansion of A327860(n): a(n) = A328114(A327860(n)).
%H A328392 Antti Karttunen, <a href="/A328392/b328392.txt">Table of n, a(n) for n = 0..30030</a>
%H A328392 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328392 a(n) = A328114(A327860(n)) = A328390(A276086(n)) = A328114(A003415(A276086(n))).
%o A328392 (PARI)
%o A328392 A327860(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= (p^e); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); };
%o A328392 A328114(n) = { my(s=0, p=2); while(n, s = max(s,(n%p)); n = n\p; p = nextprime(1+p)); (s); };
%o A328392 A328392(n) = A328114(A327860(n));
%Y A328392 Cf. A002110, A003415, A276086, A327859, A327860, A328114, A328389, A328390, A328391, A328396.
%K A328392 nonn
%O A328392 0,4
%A A328392 _Antti Karttunen_, Oct 15 2019