The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #24 Sep 27 2023 03:59:27
%S 1,6,10,504,2656,455936,3040560,1400156768,12248982496,11435578798976,
%T 123564928167168,204776117691241344,2634563519776965376,
%U 7064747252076429464064,105435171495207196553472
%N Number of Skolem sequences of order n, as n runs through the positive integers congruent to 0 and 1 mod 4.
%H 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 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 a(n) = A004075(2*n - (n mod 2)) = A004075(A042948(n)).
%Y This is A004075 without the zeros.
%Y Cf. A042948.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Feb 22 2016
%E a(14)-a(15) from A004075 added by _Max Alekseyev_, Sep 26 2023