|
%I #12 Feb 23 2016 13:18:51
%S 1,3,5,252,1328,227968,1520280,700078384,6124491248,5717789399488,
%T 61782464083584,102388058845620672,1317281759888482688
%N Number of solutions to Nickerson variant of Langford (or Langford-Skolem) problem, as n runs through the positive numbers congruent to 0 or 1 mod 4.
%C See A059106 which is the main entry for this sequence. This is A059106 with the 0's omitted.
%D For references, see A059106.
%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. A059106.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Feb 22 2016
|
