input: Write a function to generate the Fibonacci sequence up to a specified number. The function should return a list of Fibonacci numbers up to and including the given number if it is a Fibonacci number; otherwise, return an empty list. If the given number is less than 0, return an empty list as well.
  
  def Fibonacci(n):
      if n < 0:
          return []
      fib_sequence = []
      a, b = 0, 1
      while a <= n:
          fib_sequence.append(a)
          a, b = b, a + b
      return fib_sequence
  
  assert Fibonacci(0) == [0]
  assert Fibonacci(1) == [0, 1]
  assert Fibonacci(10) == [0, 1, 1, 2, 3, 5, 8, 13]
  assert Fibonacci(13) == [0, 1, 1, 2, 3, 5, 8, 13]
  assert Fibonacci(-1) == []
output: def Fibonacci(n):
      if n < 0:
          return []
      fib_sequence = []
      a, b = 0, 1
      while a <= n:
          fib_sequence.append(a)
          a, b = b, a + b
      return fib_sequence