input: Write a python function to return a list of numbers divisible by 3 or 5 up to n.
  assert divisible_numbers(10) == [3, 5, 6, 9, 10]
  assert divisible_numbers(15) == [3, 5, 6, 9, 10, 12, 15]
  assert divisible_numbers(5) == [3, 5]
output: def divisible_numbers(n):
      return [i for i in range(1, n+1) if i % 3 == 0 or i % 5 == 0]