The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A351068 Number of integers less than the (n+1)-th primorial such that the maximal exponent in their prime factorization is larger than the maximal digit in their primorial base expansion. 3

%I #5 Feb 02 2022 15:09:07

%S 0,3,14,66,357,2038,13544,102891

%N Number of integers less than the (n+1)-th primorial such that the maximal exponent in their prime factorization is larger than the maximal digit in their primorial base expansion.

%C a(n) is the number of terms of A350075 smaller than A002110(1+n).

%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>

%F a(n) = Sum_{k=1..A002110(1+n)-1} [A328114(k) < A051903(k)], where [ ] is the Iverson bracket.

%F For all n, a(n) < A351070(n).

%Y Partial sums of A351067.

%Y Cf. A002110, A051903, A276086, A328114, A350075, A351070.

%K nonn,more

%O 1,2

%A _Antti Karttunen_, Feb 02 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 09:41 EDT 2024. Contains 372733 sequences. (Running on oeis4.)