364724
domain: N
Appears in sequences
- Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n.at n=23A000031
- Number of vertex-transitive graphs with n nodes.at n=46A006799
- Number of nonisomorphic circulant graphs, i.e., undirected Cayley graphs for the cyclic group of order n.at n=46A049287
- Number of subsets of {1,2,...,n} which sum to 0 modulo n.at n=22A063776
- a(n) = (1/n) * Sum_{d divides n} (-1)^(n+d)*phi(n/d)*2^d.at n=22A074763
- Bisection of A000031.at n=11A100447
- a(n) = A159553(n)/n.at n=22A159554
- Number of Cayley graphs on n nodes.at n=46A185959
- Number of circulant graphs on n vertices up to Cayley isomorphism.at n=46A285620
- Number of binary strings of length n that are "prefix heavy", meaning that the fraction of "1" bits in any nonempty prefix is at least as great as the fraction of "1" bits in the entire string.at n=23A298072
- Number of compositions of n that are proper powers of Lyndon words.at n=45A298971
- a(n) = ceiling((2^n+n-1)/n).at n=22A373895