[seqfan] Re: An interesting problem

[Allan Wechsler]

There is a very similar dynamic displayed in the sequences https:/
oeis.org/A128280 and https:/oeis.org/A055265.

If you think of the integers [1..n] as vertices of a graph, where two
vertices are connected by an edge if the sum of the corresponding integers
is prime, then this problem is to find a Hamiltonian path from 1 to n.

I suspect that it will be easy to find a solution for 2108 by making a few
small edits to the solution for 2107, and similarly for 7288.

On Sun, Jul 2, 2023 at 12:47 PM Yifan Xie <xieyifan4013 at 163.com> wrote:

> Hi,
> I recently discovered a problem:
> For an integer n>=2, there exists a sequence {a(n)} consisting of 1, 2, 3,
> ... , n that for all 1<=i<=n, the sum of a(i) and a(i+1) is a prime.
> Do all integers n>=2 satisfy the above condition?
> The easiest algorithm to find a possible sequence is that all terms are
> the largest possible ones. For example, for n=5, the sequence starts with
> 5, since 5+4 and 5+3 are not primes, the next term is 2. Similarly, thw
> whole sequence is {5, 2, 3, 4, 1}.
> I tested this algorithm for n<=10^4 and found that only 2108 and 7288
> failed.
> Can anyone help?
>
>
> Cheers,
> Yifan Xie (xieyifan4013 at 163.com)
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>