Scan the decimal expansion of a constant (including any digits to the left of the decimal point) until all n-digit strings have been seen (including 0-padded strings). The following table then gives the number of digits that must be scanned to encounter all n = 1, 2, ...-digit strings (where "number of digits" means the ending-not starting-digit of an n-digit string) together with the last n-digit string encountered.

constant | constant primes