input: Write a function to determine if an arithmetic sequence can be formed by a given list of numbers after removing exactly one element from the list. If it is possible, return True; otherwise, return False. If the given list is empty or has only one element, return True.
  assert is_arithmetic_sequence_possible([1, 3, 5, 9])==True
  assert is_arithmetic_sequence_possible([1, 2, 4, 5, 7])==False
  assert is_arithmetic_sequence_possible([3, 6, 9, 12, 15])==True
  assert is_arithmetic_sequence_possible([1, 2, 4, 8, 16])==False
  assert is_arithmetic_sequence_possible([])==True
  assert is_arithmetic_sequence_possible([7])==True
output: def is_arithmetic_sequence_possible(nums):
      if len(nums) <= 1:
          return True
      
      def is_arithmetic(arr):
          if len(arr) <= 2:
              return True
          diff = arr[1] - arr[0]
          for i in range(2, len(arr)):
              if arr[i] - arr[i-1] != diff:
                  return False
          return True
      
      for i in range(len(nums)):
          new_nums = nums[:i] + nums[i+1:]
          if is_arithmetic(new_nums):
              return True
      
      return False