Problem 53009. Easy Sequences 48: Prime Big Omega of Factorial Sequence
For an integer n, the prime big omega function,
, is defined as the total number of prime factors of n. So, if
, since
, therefore
.
Given an integer n, write a function that evaluates the following summation:
For example for
:
In this case therefore, the function should return
.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers4
Suggested Problems
-
90343 Solvers
-
Replace NaNs with the number that appears to its left in the row.
2798 Solvers
-
81 Solvers
-
Cumulative maximum of an array
34 Solvers
-
Easy Sequences 37: Natural Factorable Polynomials
7 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!