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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
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
11, 0, 13, 23, 0, 43, 17, 0, 19, 29, 0, 67, 59, 0, 79, 89, 0, 109, 137, 0, 139, 149, 0, 223, 179, 0, 127, 227, 0, 229, 131, 0, 277, 233, 0, 307, 137, 0, 139, 239, 0, 241, 359, 0, 379, 389, 0, 409, 149, 0, 151, 251, 0, 487, 353, 0, 157, 257, 0, 457, 359, 0, 163, 263, 0, 463 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

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

LINKS

Table of n, a(n) for n=2..67.

EXAMPLE

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.

CROSSREFS

Cf. A087555.

Sequence in context: A271572 A180059 A147765 * A082268 A087557 A186072

Adjacent sequences: A087553 A087554 A087555 * A087557 A087558 A087559

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Sep 13 2003

EXTENSIONS

More terms from David Wasserman, Jun 07 2005

STATUS

approved

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 December 1 09:36 EST 2022. Contains 358467 sequences. (Running on oeis4.)