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:
  1. Make a list x of integers 1, 2, 3,…
  2. Remove the first term. That is, delete x(1).
  3. Renumber the terms.
  4. Delete x(2) and x(2+1)
  5. Renumber the terms.
  6. Delete x(3), x(3+2), and x(3+2+1).
  7. Continue renumbering and deleting terms in this way.
Write a function to compute the nth term of this sequence.
Solve

Solution Stats

28 Solutions

6 Solvers

Last Solution submitted on Jul 20, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers6

Tim Chris Cleveland George Berken Matthew Bolyard

Suggested Problems

More from this Author330

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!