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
-
254 Solvers
-
Numbers with prime factors 2, 3 and 5.
466 Solvers
-
119 Solvers
-
Make a run-length companion vector
637 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
117 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!