It sounds like a basic prefix sum would be an example, as would recurrence relations.
example Prefix sum:
output[i] = input[i] + output[i-1]
at first glance, these seem to be “inherently sequential algorithms”. However these problems often can be accomplished in parallel.
There is a seminal paper by Kogge and Stone from the 70’s that covers recurrence relations.
For a treatment of a parallel prefix sum, try this:
There are many CUDA sample codes that provide examples of how to implement these, and there are also library functions in libraries such as thrust and CUB.