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
-
263 Solvers
-
Find perfect placement of non-rotating dominoes (easier)
350 Solvers
-
Height of a right-angled triangle
1754 Solvers
-
Find terms in the Connell sequence
30 Solvers
-
Easy Sequences 25: Product of Series
16 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!