Problem 53760. Easy Sequences 62: Sum of Omega-3 Function
For an integer n, the prime big omega function,  , is defined as the total number of prime factors of n. If
, is defined as the total number of prime factors of n. If   , since
, since  , therefore
, therefore  . The omega-3 function (
. The omega-3 function ( ), is defined as raising 3 to the power of the prime big omega of n, i.e.
), is defined as raising 3 to the power of the prime big omega of n, i.e.  . In the example above,
. In the example above,  .
.
Given an integer n, write a function that returns the sum of omega-3's of all integers from 1 to n. For example for  the function output should be
 the function output should be  , since:
, since:
Solution Stats
Problem Comments
- 
		2 Comments
		William
    	on 7 Jan 2022
	
	
  	Ramon, you might want to make a small correction to the last formula in the description, though it makes no difference to the problem. The "product" symbol was probably meant to be a "summation" symbol.
		Ramon Villamangca
    	on 8 Jan 2022
	
	
  	Thanks, William.
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
- 
         
         1988 Solvers 
- 
         
         1237 Solvers 
- 
         Find state names that start with the letter N 1387 Solvers 
- 
         
         55 Solvers 
- 
         Hexagonal numbers on a spiral matrix 161 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!