The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #11 Jul 03 2017 01:34:58
%S 2,23,523,2357,112573,511327,1135217,1113251719,11171323519,
%T 113171952923,113171952923,11131951723729,11317237419529,
%U 1131723294375419,113172329541947437,1131723294195343747,1113172329419434753759
%N Smallest prime that contains all of the first n primes as substrings.
%C The 10th and 11th terms are identical because the smallest prime containing all primes through 29 as substrings also happens to include 31. - _Jon E. Schoenfield_, Sep 10 2006
%H D. Rusin, <a href="http://www.math.niu.edu/~rusin/known-math/95/1000digits">Solution for n=1000</a> [Broken link]
%H D. Rusin, <a href="/A035239/a035239.txt">Solution for n=1000</a> [Cached copy]
%Y Cf. A054261, A035239.
%K nonn,base,nice
%O 1,1
%A _Patrick De Geest_, Feb 15 2000
%E More terms from _Jon E. Schoenfield_, Sep 10 2006, corrected Oct 01 2006