Problem 43684. 0, 2, 0, -2, 0, 2, 0, -2, ...

f(x) = 0, 2, 0, -2, 0, 2, 0, -2, ..., for x = 1, 2, 3, 4, 5, 6, 7, 8, ...

Solution Comments

Problem Recent Solvers81

Suggested Problems

• Fibonacci sequence

  14145 Solvers

• How to find the position of an element in a vector without using the find function

  2815 Solvers

• Vectorize the digits of an Integer

  338 Solvers

• Find the nearest integer

  369 Solvers

• Sum of series VI

  1627 Solvers

More from this Author28

• Apply Function to Each Field of a Structure Array: Part 2

  25 Solvers

• Words Count: A Cell Array Approach

  68 Solvers

• Data Regularization

  50 Solvers

• Moving Product (Easy)

  39 Solvers

• String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values

  1973 Solvers