login
A268535
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.
1
1, 3, 5, 252, 1328, 227968, 1520280, 700078384, 6124491248, 5717789399488, 61782464083584, 102388058845620672, 1317281759888482688
OFFSET
1,2
COMMENTS
See A059106 which is the main entry for this sequence. This is A059106 with the 0's omitted.
REFERENCES
For references, see A059106.
LINKS
Ali Assarpour, Amotz Bar-Noy, Ou Liuo, Counting the Number of Langford Skolem Pairings, arXiv:1507.00315 [cs.DM], 2015.
CROSSREFS
Cf. A059106.
Sequence in context: A012817 A087367 A058846 * A268695 A167483 A101331
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Feb 22 2016
STATUS
approved