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!)
A087556 a(n) = smallest prime that is the concatenation of two numbers whose sum is n. 1

%I #5 Dec 05 2013 19:56:31

%S 11,0,13,23,0,43,17,0,19,29,0,67,59,0,79,89,0,109,137,0,139,149,0,223,

%T 179,0,127,227,0,229,131,0,277,233,0,307,137,0,139,239,0,241,359,0,

%U 379,389,0,409,149,0,151,251,0,487,353,0,157,257,0,457,359,0,163,263,0,463

%N a(n) = smallest prime that is the concatenation of two numbers whose sum is n.

%C a(3k) = 0. Conjecture: No other term is zero.

%e a(10) = 19, the Partitions of 10 are (1,9), (2,8), 3,7), (4,6), (5,5) and the primes obtained are 19,37 and 73.

%Y Cf. A087555.

%K base,nonn

%O 2,1

%A _Amarnath Murthy_, Sep 13 2003

%E More terms from _David Wasserman_, Jun 07 2005

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 April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)