login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125762 Number of planar Langford sequences. 2
0, 0, 1, 0, 0, 0, 0, 4, 0, 0, 16, 40, 0, 0, 194, 274, 0, 0, 2384, 4719, 0, 0, 31856, 62124, 0, 0, 426502, 817717, 0, 0, 5724640, 10838471, 0, 0, 75178742 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

COMMENTS

Enumerates the Langford sequences (counted by A014552) that have the additional property that we can draw noncrossing lines to connect the two 1s, the two 2s, ..., the two ns. For example, the four solutions for n=8 are 8642752468357131, 8613175368425724, 5286235743681417, 7528623574368141.

REFERENCES

D. E. Knuth, TAOCP, Vol. 4, in preparation.

LINKS

Table of n, a(n) for n=1..35.

John E. Miller, Langford's Problem

CROSSREFS

Cf. A014552, A059106.

Sequence in context: A028699 A019259 A019218 * A286216 A280727 A232357

Adjacent sequences:  A125759 A125760 A125761 * A125763 A125764 A125765

KEYWORD

nonn,more

AUTHOR

Don Knuth, Feb 03 2007

EXTENSIONS

a(31) from Rory Molinari, Feb 21 2018

a(32)-a(34) from Rory Molinari, Mar 10 2018

a(35) from Rory Molinari, May 02 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 16:40 EST 2019. Contains 319271 sequences. (Running on oeis4.)