This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A192289 #21 Feb 23 2016 19:24:32 %S A192289 1,1,26,150,17792,108144,39809640,326721800,256814891280, %T A192289 2636337861200,3799455942515488,46845158056515936, %U A192289 111683611098764903232,1607383260609382393152 %N A192289 Number of Langford pairings of order n, as n runs through the positive numbers congruent to -1 or 0 mod 4. %C A192289 See A014552 which is the main entry for this sequence. This is A014552 with the 0's omitted. %D A192289 For references, see A014552. %H A192289 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 A192289 Cf. A014552. %K A192289 nonn %O A192289 1,3 %A A192289 _N. J. A. Sloane_, Aug 03 2011 %E A192289 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_.