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.

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.

Original entry on oeis.org

3, 6, 29, 122, 633, 3587, 24091, 184924
Offset: 1

Views

Author

Antti Karttunen, Feb 02 2022

Keywords

Comments

a(n) is the number of terms of A351038 (numbers k satisfying A328114(k) <= A051903(k)) in range A002110(n) .. A002110(1+n)-1.

Examples

			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.
		

Crossrefs

Cf. also A327969.

Programs

Formula

a(n) = Sum_{k=A002110(n) .. A002110(1+n)-1} A351039(k).
For all n, a(n) > A351067(n).