Problem 57417. Easy Sequences 86: The "real" Hyperprimorials
In Easy Sequences 85, we define the hyperprimorial of n, as a exponent ladder of primes numbers from the n-th prime down to first prime (2). OEIS, however, defines hyperprimorial differently. In OEIS sequence #A076265, the hyperprimorial of n, (
) defined as follows:
where:
is the i-th prime number.
Using the above formula, we want to calculate
, which is the sum of all hyperprimorials from 1 to n:
For example:
Since this will involve large integers, please output a vector containing first 6, last 6, and the number of digits of
. Therefore, the final function output should be:
.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
Find relatively common elements in matrix rows
2149 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2521 Solvers
-
Project Euler: Problem 10, Sum of Primes
2078 Solvers
-
Create matrix of replicated elements
394 Solvers
-
Is the paranthesis sequence balanced ?
194 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!