First, we will assume they only include integers, since divisibility is hard to define with non-integers. To find positive solutions, we first must find the smallest one. The first one is obviously 1,2,3,4,5,6,7,8,9,10. Every other solution must be a multiple of lcm(1, 2, 3, 4, 5, 6, 7, 8, 9, 10), which is the product of the largest powers of primes: 8x9x5x7 = 2520. Any other number won't work, because any other number is not divisible by one of the numbers, since 2520 is the smallest number divisible by every single integer from 1 to 10. So, a few solutions would be:
(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
(2521, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530)
(5041, 5042, 5043, 5044, 5045, 5046, 5047, 5048, 5049, 5050)
Next, we must look for negative solutions. This is simple to find, just remove multiples of 2520 from the first set (1 to 10) and you can find them. Since divisibility works the same with negative numbers, we can use the exact same logic as before.
So a set could be
(-2519, -2518, -2517, -2516, -2515, -2514, -2513, -2512, -2511, -2510)
(-5039, -5038, -5037, -5036, -5035, -5034, -5033, -5032, -5031, -5030)
You can add or remove any multiple of 2520 to get more solutions, but I am NOT going to waste my time writing out an arbitarily large number of solutions.