|
%I #22 Jun 07 2020 10:43:20
%S 2,3,5,7,89,127,919,1237,8923,8929,8969,12347,89123,89137,89189,89237,
%T 89269,89293,89393,89459,89491,89567,89591,89597,89689,89797,89891,
%U 89897,91237,91249,123457,891239,891349,891379,891389,891391
%N a(1) = 2; for n > 1, a(n) is the smallest prime > a(n-1) such that each successive digit in the concatenation of terms (that does not follow 9) is greater than the previous digit.
%H Zak Seidov, <a href="/A068827/b068827.txt">Table of n, a(n) for n=1..1001</a>
%H R. J. Mathar, <a href="/A068827/a068827.txt">Maple program</a>.
%H Hugo van der Sanden, <a href="/A068827/a068827a.txt">Perl program</a>.
%e From _Petros Hadjicostas_, Jun 06 2020: (Start)
%e a(4) = 7 because 7 is the smallest prime such that, when it is concatenated to 235, we get 2357 and each successive digit is greater than the previous one.
%e a(5) = 89 because 89 is the smallest prime such that, when it is concatenated to 2357, we get 235789 and each successive digit is greater than the previous one.
%e a(6) = 127 because 127 is the smallest prime such that, when it is concatenated to 235789, we get 235789127 and each successive digit that does not follow 9 is greater than the previous one. (End)
%K nonn,base
%O 1,1
%A _Amarnath Murthy_, Mar 08 2002
%E Edited by Larry Reeves (larryr(AT)acm.org), Jan 13 2003
%E Corrected and extended by _Franklin T. Adams-Watters_, _R. J. Mathar_, _Zak Seidov_ and _Hugo van der Sanden_, May 12 2010
%E Name edited by _Petros Hadjicostas_, Jun 06 2020
|
