Finding the seed of a random number generator after x number of times incremented

I have a hash function and a seed "S". S is incremented and hashed each step. Is it possible to find S ( and its collisions ) knowing its hash?

for( i = 0; i < n; i++ ){
    S = i;
    hashOfS = hash(S);
}