Langford pairing
id:
langford-pairing-268-10473682
title:
Langford pairing
text:
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. Langford's problem is the task of finding Langford pairings for a given value of n. The closely rela
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Langford_pairing
date created:
date modified:
2022-06-14T17:47:58Z
main entity:
{"identifier":"Q3503249","url":"https://www.wikidata.org/entity/Q3503249"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/db/Langford_pairing.svg","width":558,"height":243}
fields total:
13
integrity:
14