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:
) defined as follows:
where: 
is the i-th prime number.
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:
, 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: 
.
. Therefore, the final function output should be: .Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers3
Suggested Problems
-
Return the largest number that is adjacent to a zero
5516 Solvers
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15782 Solvers
-
Remove the two elements next to NaN value
703 Solvers
-
The Answer to Life, the Universe, and Everything
577 Solvers
-
What gear ratio does the cyclist need?
159 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!
