|
%I #17 Aug 26 2021 03:23:56
%S 2,1,2,1,2,3,4,2,4,3,6,9,12,20,32,16,32,36,68,57,138,123,252,378,504,
%T 420,1296,1520,2176,2816,4096,2048,4096,3840,7040,7408,14128,14212,
%U 29224,29834,91332,87175
%N Number of distinct length-n necklaces on a size-2 alphabet.
%C They are named P(2)n-sequences in Nellore and Ward article.
%H Abhinav Nellore and Rachel Ward, <a href="https://arxiv.org/abs/2108.07759">Arbitrary-length analogs to de Bruijn sequences</a>, arXiv:2108.07759 [math.CO], 2021.
%F a(2^n) = A016031(n). - _Martin Ehrenstein_, Aug 24 2021
%Y Cf. A016031.
%K nonn,more
%O 1,1
%A _Michel Marcus_, Aug 18 2021
%E a(33)-a(42) from _Martin Ehrenstein_, Aug 25 2021
|
