27596

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=19A000031
• Number of subsets of {1,2,...,n} which sum to 0 modulo n.at n=18A063776
• Number of subsets of {1,2,3,...,n} that sum to 0 mod 19.at n=19A068040
• a(n) = (1/n) * Sum_{d divides n} (-1)^(n+d)*phi(n/d)*2^d.at n=18A074763
• G.f. satisfies: A(x + x*A(-x)) = x + x*A(x).at n=10A090594
• Bisection of A000031.at n=9A100447
• a(n) = A159553(n)/n.at n=18A159554
• Number of compositions of n into parts 3, 5 and 9.at n=54A245370
• Limiting reverse row of the array A274196.at n=54A274201
• Number of Dyck paths of semilength n such that no positive level has fewer than four peaks.at n=16A288680
• 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=19A298072
• Number of compositions of n that are proper powers of Lyndon words.at n=37A298971
• Triangle read by rows: T(n,k) is the number of acyclic digraphs on n unlabeled nodes with k arcs, n >=0, k = 0..(n-1)*n/2.at n=52A350447
• a(n) = ceiling((2^n+n-1)/n).at n=18A373895