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!)
A103547 a(n) is the smallest n-digit zeroless prime such that the sum of the two numbers that result from splitting a(n) between any two of its digits is a distinct prime, or 0 if there is no such n-digit prime. 0

%I #10 Sep 01 2014 01:45:56

%S 11,281,2267,26881,464447,6462667,0,0,0,0,0,0,0,0,0,0,0

%N a(n) is the smallest n-digit zeroless prime such that the sum of the two numbers that result from splitting a(n) between any two of its digits is a distinct prime, or 0 if there is no such n-digit prime.

%C The last digit is always odd and every other digit is even (except for a(1) = 11). - _Sean A. Irvine_, Apr 11 2010

%e a(4) = 2267. 2 + 267 = 269, which is prime. 22 + 67 = 89, which is prime. 226 + 7 = 233, which is prime.

%e a(2) is NOT 227 because 2 + 27 = 29 and 22 + 7 = 29 are the same prime. [From _Sean A. Irvine_, Apr 11 2010]

%K base,more,nonn

%O 2,1

%A _Ray G. Opao_, Mar 23 2005

%E More terms from _Sean A. Irvine_, Apr 11 2010

%E a(13)-a(18) from _Hiroaki Yamanouchi_, Aug 31 2014

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 September 9 21:41 EDT 2024. Contains 375765 sequences. (Running on oeis4.)