|
|
A066313
|
|
Number of aperiodic necklaces with n red or blue beads such that two necklaces are equivalent under the operation of simultaneously turning the necklace over and switching the two colors.
|
|
3
|
|
|
1, 1, 1, 2, 3, 6, 9, 18, 28, 57, 93, 181, 315, 612, 1091, 2100, 3855, 7392, 13797, 26436, 49929, 95790, 182361, 350440, 671088, 1292445, 2485504, 4797261, 9256395, 17903316, 34636833, 67124160, 130150493, 252675975, 490853403, 954498874, 1857283155, 3616938738
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Also number of aperiodic cyclic graphs with oriented edges on n nodes that can be turned over.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The equivalence requires the "turning over" operation and the "switching colors" operation to be simultaneous; thus rrrbbrrb is equivalent to rbbrrbbb, but not to bbbrrbbr.
|
|
PROG
|
b(n)={(sumdiv(n, d, eulerphi(d)*2^(n/d))/n + if(n%2==0, 2^(n/2-1)))/2}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|