27598

Appears in sequences

• Number of subsets (up to cyclic shifts) of the n-th roots of 1 with zero sum.at n=56A164896
• Partial sums of A169707.at n=41A253098
• Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of two and m runs through the set of least numbers whose prime signature is a partition of n.at n=19A309691
• a(n) is the sum of (2^n mod k) for odd numbers k < 2^(n-1).at n=9A339603
• a(n) = Sum_{k=0..n} binomial(n, k)*CT(n, k) = Sum_{k=0..n} (-1)^(n-k)*binomial(n, k)*CT(n, k), where CT(n, k) is the Catalan triangle A053121.at n=10A344500