|
| |
|
|
A192289
|
|
Number of Langford pairings of order n, as n runs through the positive numbers congruent to -1 or 0 mod 4.
|
|
1
|
|
|
|
1, 1, 26, 150, 17792, 108144, 39809640, 326721800, 256814891280, 2636337861200, 3799455942515488, 46845158056515936, 111683611098764903232, 1607383260609382393152
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
See A014552 which is the main entry for this sequence. This is A014552 with the 0's omitted.
|
|
|
REFERENCES
|
For references, see A014552.
|
|
|
LINKS
|
Table of n, a(n) for n=1..14.
Ali Assarpour, Amotz Bar-Noy, Ou Liuo, Counting the Number of Langford Skolem Pairings, arXiv:1507.00315 [cs.DM], 2015.
|
|
|
CROSSREFS
|
Cf. A014552.
Sequence in context: A200449 A248465 A014552 * A230906 A232585 A042314
Adjacent sequences: A192286 A192287 A192288 * A192290 A192291 A192292
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
N. J. A. Sloane, Aug 03 2011
|
|
|
EXTENSIONS
|
Corrected and extended using results from the Assarpour et al. (2015) paper by N. J. A. Sloane, Feb 22 2016 at the suggestion of William Rex Marshall.
|
|
|
STATUS
|
approved
|
| |
|
|
