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!)
A075611 a(1) = 1, a(n) = smallest number > a(n-1) such that concatenation a(k) a(n) is prime for all k = 1 to n-1. Stop if no such number exists. 2

%I #5 Dec 05 2013 19:55:39

%S 1,3,7,73,433,607,13381,37279,4800307,1281054613

%N a(1) = 1, a(n) = smallest number > a(n-1) such that concatenation a(k) a(n) is prime for all k = 1 to n-1. Stop if no such number exists.

%C The sequence is probably finite.

%e a(5)=433 since 1433, 3433, 7433 and 73433 are all primes and for every 73<x<433, at least one of 1x, 3x, 7x, 73x is not prime.

%K base,more,nonn

%O 1,2

%A _Amarnath Murthy_, Sep 28 2002

%E Corrected and extended by _Giovanni Resta_, Jun 18 2003

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 May 5 21:49 EDT 2024. Contains 372290 sequences. (Running on oeis4.)