Jud McCranie jud.mccranie at mindspring.com
Tue Jun 18 06:17:58 CEST 2002

At 08:58 AM 6/18/2002 +0800, Gordon Royle wrote:
>Sequence A051252 is the number of ways of arranging the integers 1..2n on a
>circle so that the sum of any two adjacent numbers is prime.
>The numbers get large very quickly.
>But is there any proof that this can always be done?

I don't know of any proof, but I expect it to be true.

|       Jud McCranie                                      |
|                                                         |
| Programming Achieved with Structure, Clarity, And Logic |

More information about the SeqFan mailing list