|
Search: id:A134292
|
|
|
| A134292 |
|
Triangle in which row n is the lexicographically earliest solution to the prime circle problem for 2n. |
|
+0
1
|
|
| 1, 2, 1, 2, 3, 4, 1, 4, 3, 2, 5, 6, 1, 2, 3, 8, 5, 6, 7, 4, 1, 2, 3, 4, 7, 6, 5, 8, 9, 10, 1, 2, 3, 4, 7, 6, 5, 12, 11, 8, 9, 10, 1, 2, 3, 4, 7, 6, 13, 10, 9, 14, 5, 8, 11, 12, 1, 2, 3, 4, 7, 6, 5, 12, 11, 8, 9, 14, 15, 16, 13, 10, 1, 2, 3, 4, 7, 6, 5, 8, 9, 10, 13, 16, 15, 14, 17, 12, 11, 18, 1, 2, 3
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
In the prime circle problem we seek to arrange the numbers 1 to 2n around a circle so that the sum of each pair of adjacent numbers is prime. To display the solution, we unroll the circle starting at 1.
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems Number Theory, Section C1.
|
|
LINKS
|
T. D. Noe, Rows n=1..50 of triangle, flattened
Eric Weisstein's World of Mathematics, Prime Circle
|
|
EXAMPLE
|
1, 2; 1, 2, 3, 4; 1, 4, 3, 2, 5, 6; 1, 2, 3, 8, 5, 6, 7, 4;...
|
|
CROSSREFS
|
Cf. A051252 (number of solutions for each n), A051237 (prime pyramid).
Adjacent sequences: A134289 A134290 A134291 this_sequence A134293 A134294 A134295
Sequence in context: A074294 A062050 A046653 this_sequence A108715 A119671 A033787
|
|
KEYWORD
|
nice,nonn,tabl
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Oct 16 2007
|
|
|
Search completed in 0.002 seconds
|
