cp's OEIS Frontend

A052079 Concatenation of n consecutive ascending numbers starting from a(n) produces the smallest possible prime of this form, 0 if no such prime exists.

%I A052079 #24 Mar 04 2021 09:20:40
%S A052079 2,2,0,4,15,0,7,2,0,4,129,0,5,50,0,128,3,0,23,38,0,9998,17,0,25,2,0,
%T A052079 16,341,0,569,42,0,14,1203,0,2465,102,0,212,1161,0,197
%N A052079 Concatenation of n consecutive ascending numbers starting from a(n) produces the smallest possible prime of this form, 0 if no such prime exists.
%C A052079 Next term a(44)=10^348-32 (only probable prime with 15324 digits). a(110)=9999968. If n is divisible by 22 then either a(n)=0 or a(n)=10^x-b for some b<n. - _Jens Kruse Andersen_, Feb 03 2003
%H A052079 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_078.htm">Puzzle 78. The least prime by concatenating K consecutive integers</a>, The Prime Puzzles and Problems Connection.
%e A052079 For n = 7 we have a(7) = 7 so the seven consecutive ascending numbers 7,8,9,10,11,12 and 13 concatenated together gives the smallest possible prime of this form, 78910111213.
%o A052079 (PARI) isok(vc) = {my(x=""); for (i=1, #vc, x = concat(x, Str(vc[i]))); ispseudoprime(eval(x));}
%o A052079 a(n) = if (n % 3, for(i=1, oo, my(vc = vector(n, k, k+i-1)); if (isok(vc), return(i))), 0); \\ _Michel Marcus_, Mar 04 2021
%Y A052079 Cf. A030996, A052077, A052078, A052080.
%K A052079 nonn,base,hard
%O A052079 1,1
%A A052079 _Patrick De Geest_, Jan 15 2000
%E A052079 Terms a(7)-a(43) calculated by _Carlos Rivera_ and _Felice Russo_