Problem 3002. Not square-free number sequence
Not square-free numbers are all positive integers divisible by a square greater than one: 4, 8, 9, 12, 16, 18, 20, 24, 25, 27, ... For example, 4 = 2^2, 8 = 2^2 * 2, 9 = 3^2, 12 = 2^2 * 3, etc.
Return numbers from the square-free sequence corresponding to the supplied indices. For example, if n = 3:7, your function should return [9, 12, 16, 18, 20].
Solution Stats
Problem Comments
Solution Comments
Show commentsGroup

Sequences & Series III
- 15 Problems
- 38 Finishers
- Sphenic number sequence
- Sphenic number sequence
- Not square-free number sequence
- Return fibonacci sequence do not use loop and condition
- Mobius function
- Not square-free number sequence
- Mobius function
- Self-similarity 1 - Every other term
- Self-similarity 2 - Every third term
- Self-similarity 3 - Every other pair of terms
- Twin Primes
- Pattern Recognition 1 - Known Unit Length
- Pattern Recognition 2 - Known Unit Length, Various Array Length (including cell arrays)
- Pattern Recognition 3 - Variable Unit and Array Length (including cell arrays)
- Return fibonacci sequence do not use loop and condition
- Return fibonacci sequence do not use loop and condition version 2
- Gold Standard
- Gold/Silver Standard
- Weighted Gold/Silver Standard
Problem Recent Solvers66
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!