In a traditional Ceasar Cipher, you pick a specific offset such as "plus three" so that to encrypt each character of a message you count three letters up from the input and to decrypt you count three letters down from the input. For example, "APPLE" would become "DSSOH" where D is A+3, S is P+3, and so on.
I saw a variant of this where the key is used as the seed of a random number generator instead of a constant offset, and those random offsets are then used to encode the message. This has the advantage that the same input characters are not mapped to the same output characters. For example, my RNG might generate a sequence of 3 7 5 0 2, so then "APPLE" would become "DWULG" where D is A+3, W is P+7, U is P+5, etc.
Since the random number generator is deterministic, you can re-seed the RNG with the original key and generate the same random sequence to decode.
Is there a specific name for this type of cipher?