Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:alsoKnownAs |
gptkb:Langford_pairing
|
| gptkbp:application |
combinatorics
permutation problems |
| gptkbp:category |
integer sequence
|
| gptkbp:defines |
A sequence of 2n numbers in which each number from 1 to n appears exactly twice, and the two occurrences of the number k are k numbers apart.
|
| gptkbp:exampleForN3 |
2 3 1 2 1 3
|
| gptkbp:existsIn |
n ≡ 0 or 3 (mod 4)
|
| gptkbp:firstDescribed |
1958
|
| https://www.w3.org/2000/01/rdf-schema#label |
Langford sequence
|
| gptkbp:minimumN |
n=3
|
| gptkbp:namedAfter |
gptkb:C._Dudley_Langford
|
| gptkbp:OEIS |
A180632
|
| gptkbp:relatedTo |
gptkb:Skolem_sequence
|
| gptkbp:studiedIn |
discrete mathematics
number theory |
| gptkbp:bfsParent |
gptkb:Skolem_sequence
|
| gptkbp:bfsLayer |
6
|