Cody

Problem 42832. Segmented number sequence

  • Created by HH
Given a positive integer, n, and a row vector, x, of positive integers, return a row vector, v, which is a sequence of length n of positive integers, beginning with [1 2...], in which integers that are the sums of any x(i) consecutive previous elements are omitted.
For example, if x = [2 3], meaning integers that are sums of any 2 or 3 consecutive previous elements should be omitted, the output would be v = [1 2 4 5 8 10...v(n)], because 3 is the sum of [1 2], 6 is the sum of [2 4], 7 is the sum of [1 2 4], 9 is the sum of [4 5], and so on, up to n elements of v.
If x = 0, integers that are the sums of any 2 or more consecutive previous elements should be omitted.
Solve

Solution Stats

26.92% Correct | 73.08% Incorrect
Last Solution submitted on Dec 25, 2022

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers15

Suggested Problems

More from this Author45

Problem Tags

numbers sequence

Community Treasure Hunt

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

Start Hunting!