671088

Appears in sequences

• Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is not allowed but the two colors can be interchanged.at n=25A000048
• a(n) = floor(2^(n-1)/n).at n=24A006788
• Number of binary Lyndon words with an even number of 1's.at n=24A051841
• Number of binary vectors (x_1,...x_n) satisfying Sum_{i=1..n} i*x_i = 3 (mod n+1) = size of Varshamov-Tenengolts code VT_3(n).at n=24A054200
• Number of primitive (period n) n-bead necklace structures using exactly two different colored beads.at n=24A056303
• a(n) = floor(8^8/n).at n=24A057070
• Number of orbits of length n under a map whose periodic points are counted by A027306.at n=24A060172
• Number of orbits of length n in a map whose periodic points come from A059991.at n=24A060481
• 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.at n=24A066313
• Number of identity (asymmetric) bracelets (or necklaces) with n red or blue beads such that the beads switch colors when bracelet is turned over.at n=24A066314
• A104013 in decimal.at n=24A104014
• A104013 in decimal.at n=49A104014
• Number of binary vectors (x_1,...x_(n-1)) satisfying Sum_{i=1..n-1} (-1)^i*i*x_i = 0 (mod n).at n=23A114702
• Number of cycles of length n under the mapping x -> x^2-2 modulo Fermat prime 2^(2^m)+1, where m is any fixed integer such that n divides 2^m-1.at n=12A131203
• a(n) = floor((1 + 4^n)/(1 + 2*n)).at n=11A191637
• Renyi-Ulam liar numbers: maximum k such that n questions "Is x in subset S of {1,...,k}?" are guaranteed to determine x when at most one answer can be a lie.at n=24A286496