Unra is a uniform random number generator based on theory and suggestions given in d.e. Knuth (1969), vol 2. The integer iy (seed) should be initialized to an arbitrary integer prior to the first call to urand. The calling program should not alter the value of iy between subsequent calls to unra.Values of unra are returned in the interval (0,1). The recursive algorithm of unra is
/6))+1