Can the SHA256 hashes of consecutive integers be attacked?
If we assume that the range of possible values of $n/k$ is sufficiently large that it is infeasible for the attacker to scan through $\operatorname{SHA256}(ik)$ values (and look for a match in one of the hashes), then it would appear to be secure.  There is no known weakness in SHA256 about hashing related messages.