|
%I #21 Feb 23 2016 19:24:32
%S 1,1,26,150,17792,108144,39809640,326721800,256814891280,
%T 2636337861200,3799455942515488,46845158056515936,
%U 111683611098764903232,1607383260609382393152
%N Number of Langford pairings of order n, as n runs through the positive numbers congruent to -1 or 0 mod 4.
%C See A014552 which is the main entry for this sequence. This is A014552 with the 0's omitted.
%D For references, see A014552.
%H Ali Assarpour, Amotz Bar-Noy, Ou Liuo, <a href="http://arxiv.org/abs/1507.00315">Counting the Number of Langford Skolem Pairings</a>, arXiv:1507.00315 [cs.DM], 2015.
%Y Cf. A014552.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Aug 03 2011
%E 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_.
|
