9256395

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=29A000048
• Lerch's function q_2(n) = (2^{phi(t)} - 1)/t where t = 2*n - 1.at n=14A001226
• a(n) = floor(2^(n-1)/n).at n=28A006788
• Fermat quotients: (2^(p-1)-1)/p, where p=prime(n).at n=8A007663
• Number of Hamiltonian cycles in the directed graph with 2n nodes {0..2n-1} and edges from each i to 2i (mod 2n) and to 2i+1 (mod 2n).at n=28A027362
• Number of binary Lyndon words with an even number of 1's.at n=28A051841
• 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=28A054200
• Nearest integer to 2^(n-1)/n.at n=28A054650
• Number of n-bead necklace structures using exactly two different colored beads.at n=28A056295
• Number of primitive (period n) n-bead necklace structures using exactly two different colored beads.at n=28A056303
• Number of orbits of length n under a map whose periodic points are counted by A027306.at n=28A060172
• Number of orbits of length n in a map whose periodic points come from A059991.at n=28A060481
• 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=28A066313
• 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=28A066314
• Number of different sets of n-gons labeled 1...n such that all members of each set contain equivalent paths with increasing labels; i.e., the number of isotemporal classes of n-gons.at n=26A092481
• 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=27A114702
• Reduced numerators of 2*(2^(1+n)-1)/(1+n)/(2+n).at n=27A116419
• 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=14A131203
• a(n) = (2^A002326(n)-1)/(2*n+1).at n=14A165781
• a(n) = numerator of the coefficient c(n) of x^n in sqrt(1+x)/Product_{k=1..n-1} 1 + c(k)*x^k, n = 1, 2, 3, ...at n=28A170922