[seqfan] Re: put the numbers from 1 to n such the sum of two of them are prime

[franktaw at netscape.net]

Well, as you've stated it, there are no solutions for n>9, because you 
run out of digits. (Also note the solution for n=2 is 12, not 23.)

If we look at sequences of numbers 1 through n with adjacent pairs 
summing to a prime, then this is a known problem; see 
https://oeis.org/A051237.

Franklin T. Adams-Watters

-----Original Message-----
From: Claudio Meller <claudiomeller at gmail.com>

In the blog "Mis Acertijos" (
http://www.misacertijos.com.ar/2011/03/lineas-con-numeros-de-1-n.html)  
this
problem appears:
make a number K with the digits from 1 to n such the sum of two 
consecutive
digits is a prime number, for example (with minimal K):

n=2  23
n=3 123
n=4 1234
n=5 14325
n=6  143256

The secuence begins 23,123,1234,14325,143256,....

The questions are :
 - There is a solution for all n > 2 ?
 - Is this a known problem ?

Claudio