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 A268537 #24 Sep 27 2023 03:59:27 %S A268537 1,6,10,504,2656,455936,3040560,1400156768,12248982496,11435578798976, %T A268537 123564928167168,204776117691241344,2634563519776965376, %U A268537 7064747252076429464064,105435171495207196553472 %N A268537 Number of Skolem sequences of order n, as n runs through the positive integers congruent to 0 and 1 mod 4. %H A268537 Ali Assarpour, Amotz Bar-Noy, and Ou Liuo, <a href="http://arxiv.org/abs/1507.00315">Counting the Number of Langford Skolem Pairings</a>, arXiv:1507.00315 [cs.DM], 2015. %H A268537 James Bubear, Joanne Hall, Kevin Hendrey, and Tim Wilson, <a href="http://arxiv.org/abs/1602.08879">Skolem Circles</a>, arXiv:1602.08879 [math.CO], 2016. %F A268537 a(n) = A004075(2*n - (n mod 2)) = A004075(A042948(n)). %Y A268537 This is A004075 without the zeros. %Y A268537 Cf. A042948. %K A268537 nonn %O A268537 1,2 %A A268537 _N. J. A. Sloane_, Feb 22 2016 %E A268537 a(14)-a(15) from A004075 added by _Max Alekseyev_, Sep 26 2023