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 Solvers4
Suggested Problems
-
2728 Solvers
-
1797 Solvers
-
Count from 0 to N^M in base N.
241 Solvers
-
Sort numbers by outside digits
162 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
14122 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!