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
-
2366 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
884 Solvers
-
97 Solvers
-
Matrix rotation as per given angle
120 Solvers
-
Lowest sum from a group of digits
55 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!