Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
combinatorial problem
|
| gptkbp:alsoKnownAs |
gptkb:Langford_sequence
|
| gptkbp:application |
mathematical puzzles
|
| gptkbp:describes |
Arrangement of 2n numbers 1,1,2,2,...,n,n such that between the two occurrences of k there are exactly k numbers.
|
| gptkbp:existenceCondition |
Exists if and only if n mod 4 = 0 or n mod 4 = 3
|
| gptkbp:field |
gptkb:mathematics
combinatorics |
| gptkbp:firstDescribed |
1958
|
| https://www.w3.org/2000/01/rdf-schema#label |
Langford pairing
|
| gptkbp:namedAfter |
gptkb:C._Dudley_Langford
|
| gptkbp:OEIS |
A180632
|
| gptkbp:relatedTo |
gptkb:Skolem_sequence
|
| gptkbp:bfsParent |
gptkb:Langford_sequence
|
| gptkbp:bfsLayer |
7
|