A similar one is here.
You didn't restrict yourself to using only 0-9 in your sequence, though.
Same as Problem 55 Counting Sequence.
The best solution without regexprep.
The Goldbach Conjecture
Project Euler: Problem 3, Largest prime factor
Make one big string out of two smaller strings
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office