cp's OEIS Frontend

A351069 Number of integers in range A002110(n) .. A002110(1+n)-1 such that the maximal digit in their primorial base expansion is not larger than the maximal exponent in their prime factorization, where A002110(n) gives the n-th primorial.

%I A351069 #11 Feb 02 2022 15:09:02
%S A351069 3,6,29,122,633,3587,24091,184924
%N A351069 Number of integers in range A002110(n) .. A002110(1+n)-1 such that the maximal digit in their primorial base expansion is not larger than the maximal exponent in their prime factorization, where A002110(n) gives the n-th primorial.
%C A351069 a(n) is the number of terms of A351038 (numbers k satisfying A328114(k) <= A051903(k)) in range A002110(n) .. A002110(1+n)-1.
%F A351069 a(n) = Sum_{k=A002110(n) .. A002110(1+n)-1} A351039(k).
%F A351069 For all n, a(n) > A351067(n).
%e A351069 There are six numbers in range A002110(2) .. A002110(3)-1 [in 6 .. (30-1)] that satisfy the condition: 6, 7, 8, 9, 12, 16, therefore a(2) = 6.
%o A351069 (PARI)
%o A351069 A002110(n) = prod(i=1,n,prime(i));
%o A351069 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A351069 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A351069 A351039(n) = (A051903(A276086(n)) <= A051903(n));
%o A351069 A351069(n) = sum(k=A002110(n),A002110(1+n)-1,A351039(k));
%Y A351069 Cf. A002110, A051903, A276086, A328114, A351038, A351039, A351067, A351070 (partial sums).
%Y A351069 Cf. also A327969.
%K A351069 nonn,more
%O A351069 1,1
%A A351069 _Antti Karttunen_, Feb 02 2022