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

• Return the Fibonacci Sequence

  1506 Solvers

• Equal to their cube

  448 Solvers

• Flip the bit

  532 Solvers

• Y=X

  1046 Solvers

• Sum of the Multiplication of Vectors

  286 Solvers

More from this Author28

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

  31 Solvers

• String Array Basics, Part 4: Convert String Array with Missing Values to Cell Array

  119 Solvers

• Cody meets Xiangqi: foresee the unseen (Part 1)

  9 Solvers

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

  1966 Solvers

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

  153 Solvers