Mostly to Dan Asimov. Earthlink doesn't like my mail server, the message below wasn't delivered. Best regards, jj ----- Forwarded message from Joerg Arndt <arndt@jjj.de> ----- Date: Sun, 7 Apr 2019 14:00:08 +0200 From: Joerg Arndt <arndt@jjj.de> To: Dan Asimov <dasimov@earthlink.net> Subject: Re: To Joerg Re: [math-fun] Fun with shift register sequences (connecting A000031 and A000016) * Dan Asimov <dasimov@earthlink.net> [Apr 03. 2019 13:07]:
Joerg,
Maybe I missed something, but I don't know what necklaces you are referring to here.
I thought it might be all circular sequences of two colors of beads, but your examples don't seem to confirm that.
That is correct. I show only the primitive part, so instead of . ....1 ...11 ..1.1 ..111 .1.11 .1111 1 you may want to see ..... ....1 ...11 ..1.1 ..111 .1.11 .1111 11111 (first and last have period 1). Does this make things clear? Best regards, Joerg
I hope you won't mind clarifying ...
Thanks,
Dan
Joerg Arndt a écrit: ----- To generate the necklaces for length n... ... ... -----
----- End forwarded message -----