So, rather than using $\pi$, is there any way that isn't overly complicated, (and can be calculated on a computer without taking a year) in which I could generate an infinite string of numbers that could ultimately contain any string of numbers?
Or, if this wouldn't work, do the same but only containing $0$'s and $1$'s?
Must also be able to generate the exact same string every time.
I know this may seem silly/specific for a question, but the idea is that you could find a long though not too large string of numbers, either with the digits $0$-$9$ (or $0$-$1$, using binary)
So, is this possible (in a realistic way) either in some method of $\pi$ or other formulas?
Also, I'm no mathematician, so please make sure to explain in a somewhat simple way.
Update: for instance, searching for $482744003642356604274627660076007$, would take a enormous amount of time and energy to find in pi, but I would like a method to easily find something like that.
I also appreciate all the help!