With TIME(S) as the seed, it is not going to take too zippy a CPU to get the same TIME(S) for five iterations.
I only ever specify one seed for use of RANDOM (whatever language) and roll with that.
If you use TIME(S), if you happen to, to the second, run it at the same time as one you have done previously, you will get the same numbers. Not so difficult to do. We used to "draw" our numbers at 17:00 on a Friday.
To obtain a predictable sequence of quasi-random numbers, use RANDOM a number of times, but specify a seed only the first time. For example, to simulate 40 throws of a 6-sided, unbiased die:
sequence = RANDOM(1,6,12345) /* any number would */
/* do for a seed */
sequence = sequence RANDOM(1,6)
The numbers are generated mathematically, using the initial seed, so that as far as possible they appear to be random. Running the program again produces the same sequence; using a different initial seed almost certainly produces a different sequence. If you do not supply a seed, the first time RANDOM is called, the microsecond field of the time-of-day clock is used as the seed; and hence your program almost always gives different results each time it is run.
The random number generator is global for an entire program; the current seed is not saved across internal routine calls.