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 comments
Loading...
Problem Recent Solvers3
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5797 Solvers
-
Return a list sorted by number of consecutive occurrences
428 Solvers
-
The Answer to Life, the Universe, and Everything
577 Solvers
-
Calculate the probability that at least two people in a group share the same birthday.
103 Solvers
-
How long do each of the stages of the rocket take to burn?
456 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!