Problem 60411. Compute a sequence with the whyphi sieve
A few problems on Cody involve sieving. For example, Cody Problem 45367 involves the famous Sieve of Eratosthenes. CP 50811 uses the sieve of Flavius Josephus, and CP 50913 uses the golden sieve.
This problem uses a process that I will call the whyphi sieve:
- Make a list x of integers 1, 2, 3,…
- Remove the first term. That is, delete x(1).
- Renumber the terms.
- Delete x(2) and x(2+1)
- Renumber the terms.
- Delete x(3), x(3+2), and x(3+2+1).
- Continue renumbering and deleting terms in this way.
Write a function to compute the nth term of this sequence.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
Given two arrays, find the maximum overlap
1497 Solvers
-
6655 Solvers
-
251 Solvers
-
Detect a number and replace with two NaN's
190 Solvers
-
34 Solvers
More from this Author278
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!