49929

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=21A000048
• Number of binary Lyndon words with an even number of 1's.at n=20A051841
• Number of primitive (period n) n-bead necklace structures using exactly two different colored beads.at n=20A056303
• Number of orbits of length n under a map whose periodic points are counted by A027306.at n=20A060172
• Number of orbits of length n in a map whose periodic points come from A059991.at n=20A060481
• 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=20A066313
• 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=20A066314
• Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=29A097647
• 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=19A114702
• 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=10A131203
• Partial sums of floor(4^n/7).at n=8A178710
• a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least two elements of S) = difference between greatest two elements of S.at n=20A357292