login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A340487 a(n) is the least prime that is the concatenation of two n-digit primes, or 0 if there are none. 2

%I #53 Jan 13 2021 10:39:58

%S 23,1117,101107,10091021,1000710181,100003100129,10000031000171,

%T 1000001910000349,100000007100000541,10000000071000000349,

%U 1000000001910000000319,100000000003100000000063,10000000000391000000000903,1000000000003710000000000259,100000000000031100000000000403

%N a(n) is the least prime that is the concatenation of two n-digit primes, or 0 if there are none.

%C Conjecture: a(n) > 0 and the first n digits of a(n) = A003617(n). - _Chai Wah Wu_, Jan 13 2021

%H Chai Wah Wu, <a href="/A340487/b340487.txt">Table of n, a(n) for n = 1..500</a> (n = 1..380 from Robert Israel)

%e a(3) = 101107 is prime and the concatenation of the two 3-digit primes 101 and 107.

%p f:= proc(d) local P,a,b;

%p a:= prevprime(10^(d-1));

%p do

%p a:= nextprime(a);

%p if a > 10^d then return FAIL fi;

%p b:= prevprime(10^(d-1));

%p do

%p b:= nextprime(b);

%p if b > 10^d then break fi;

%p if isprime(10^d*a+b) then return 10^d*a+b fi;

%p od od:

%p FAIL

%p end proc:

%p f(1):= 23:

%p map(f, [$1..20]);

%Y Cf. A003617.

%K nonn,base

%O 1,1

%A _J. M. Bergot_ and _Robert Israel_, Jan 10 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 22:25 EDT 2024. Contains 374323 sequences. (Running on oeis4.)