|
Search: id:A050998
|
|
|
| A050998 |
|
Lexicographically earliest solution to Langford (or Langford-Skolem) problem of arranging the numbers 1,1,2,2,3,3,...,n,n so that there is one number between the two 1's, two numbers between the two 2's, ..., n numbers between the two n's. |
|
+0
5
|
|
| 231213, 23421314, 14156742352637, 14167345236275, 15146735423627, 15163745326427, 15167245236473, 15173465324726, 16135743625427, 16172452634753, 17125623475364, 17126425374635, 23627345161475
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
