: Matemáticas: Langford sequence

mathematical analysis > combinatorics > Langford sequence

algebra > combinatorics > Langford sequence

Langford sequence

In combinatorial mathematics, a Langford pairing, also called a Langford sequence, is a permutation of the sequence of 2n numbers 1, 1, 2, 2, ..., n, n in which the two 1s are one unit apart, the two 2s are two units apart, and more generally the two copies of each number k are k units apart. Langford pairings are named after C. Dudley Langford, who posed the problem of constructing them in 1958.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Langford_pairing)

http://data.loterre.fr/ark:/67375/PSR-H2HH6NWV-C

RDF/XML TURTLE JSON-LD

Loterre