A058813 - OEIS

%I #22 Aug 28 2022 16:50:39

%S 0,0,1,0,1,0,1,3,5,0,1,3,5,0,1,3,5,7,9,11,21,0,1,3,5,7,9,11,13,19,21,

%T 0,1,3,5,7,9,11,13,15,17,19,21,23,25,27,37,43,45,51,85,0,1,3,5,7,9,11,

%U 13,15,17,19,21,23,25,27,29,35,37,39,41,43,45,51,53,73,75,77,83,85

%N Unlabeled (i.e., equivalent to their 1-0 complement) binary necklaces sorted in ascending lexicographic order and read as binary numbers.

%H Sean A. Irvine, <a href="/A058813/b058813.txt">Table of n, a(n) for n = 1..4280</a>

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a058/A058813.java">Java program</a> (github)

%H F. Ruskey, <a href="http://combos.org/necklace">Necklaces, Lyndon words, De Bruijn sequences, etc.</a>

%H F. Ruskey, <a href="/A000011/a000011.pdf">Necklaces, Lyndon words, De Bruijn sequences, etc.</a> [Cached copy, with permission, pdf format only]

%H <a href="/index/Ne#necklaces">Index entries for sequences related to necklaces</a>

%e a(5)=1 because it corresponds to the necklace 01; a(13)=5 because it corresponds to the necklace 0101.

%e From _Sean A. Irvine_, Aug 28 2022: (Start)

%e   0;

%e   0, 1;

%e   0, 1;

%e   0, 1, 3, 5;

%e   0, 1, 3, 5;

%e   0, 1, 3, 5, 7, 9, 11, 21;

%e   0, 1, 3, 5, 7, 9, 11, 13, 19, 21;

%e   ...

%e (End)

%Y Cf. A000013 (row lengths).

%K nonn,tabf

%O 1,8

%A Felix Goldberg (felixg(AT)tx.technion.ac.il), Jan 03 2001

%E More terms from _Sean A. Irvine_, Aug 28 2022