The repeating strings become progressively shorter and the scrambled strings become larger until eventually the repeating strings disappear. However, by increasing n we can forestall the disappearance of the repeating strings as long as we like. The repeating digits are always 1, 5, 6, 2, 4, 9, 6, 3, 9, 2, ... .
1111111111111111111111111.1111111111111111111111 0860
555555555555555555555555555555555555555555555 2730541
66666666666666666666666666666666666666666 0296260347
2222222222222222222222222222222222222 0426563940928819
4444444444444444444444444444444 38775551250401171874
9999999999999999999999999999 808249687711486305338541
66666666666666666666666 5987185738621440638655598958
33333333333333333333 0843460407627608206940277099609374
99999999999999 0642227587555983066639430321587456597
222222222 1863492016791180833081844
The sequence of numbers generated by the recurrence relation f(n) = 10 f(n − 1) + n described above is:
0, 1, 12, 123, 1234, 12345, 123456, 1234567, 12345678, 123456789, 1234567900, ... (sequence A014824 in the OEIS).
f(49) = 1234567901234567901234567901234567901234567901229