|
%I #13 Jul 08 2023 13:45:24
%S 12345678910111,2,13,14151617,181,
%T 920212223242526272829303132333435363738394041424344454647484950515253,
%U 5
%N Write the natural numbers as an infinite sequence of digits; starting at the left, cut into the smallest pieces so that each piece is a prime.
%C This is a "lossless" base-10 sequential-smallest-prime percolation of a Champernowne-substrate. The "lossy" version is A162324. The substrate percolates into identical terms 4-115 for both lossless and lossy versions. Terms 117-153 and 155-218 of the lossless version correspond to terms 119-155 and 158-221, respectively, of the lossy version. No other correspondences are known because of the subsequent interjection of very large primes. (For the purposes of this analysis, large probable primes have been treated as actual primes.)
%H Hans Havermann, <a href="http://chesswanks.com/seq/b103575.txt">Indexed list of terms 1-257 (includes large probable primes)</a>
%H Dario Alpern, <a href="https://www.alpertron.com.ar/ECM.HTM">On-line routine to factor and prove primality</a>
%H Prime Pages, <a href="https://t5k.org/curios/includes/file.php?file=primetest.html">primality test</a>
%e 1 is not prime, 12 is not prime, 123 is not prime, 1234 is not prime, 12345 is not prime, etc. 1234567891 is prime but has to be rejected because the next term would begin with "0". The first one which works (thus the smallest one) is 12345678910111, matching the first 14 digits of the counting numbers, ... which is thus a(1).
%e The next digit of the counting numbers is 2 which is the smallest prime continuing the counting digits.
%K base,nonn
%O 1,1
%A _Alexandre Wajnberg_, Mar 23 2005
%E Edited by _Hans Havermann_, Dec 07 2009
| 