32640

Appears in sequences

• Number of 2n-bead balanced binary necklaces of fundamental period 2n, equivalent to reversed complement; also Dirichlet convolution of b_n=2^(n-1) with mu(n); also number of components of Mandelbrot set corresponding to Julia sets with an attractive n-cycle.at n=15A000740
• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.at n=17A000749
• a(n) = 2^(n-1)*(2^n - (-1)^n).at n=8A003674
• a(n) = 2^(n-1)*(2^n - 1), n >= 0.at n=8A006516
• Denominator of B_{2n}/(-4n), where B_m are the Bernoulli numbers.at n=16A006863
• a(n) = denominator of Bernoulli(2n)/(2n).at n=31A006953
• Dual pairs of integrals arising from reflection coefficients.at n=16A007179
• Number of Barlow packings with group P6(bar)m2 that repeat after 2n layers.at n=16A011949
• a(n) = 4^n*(4^n - 1)/2.at n=4A026337
• Numbers k such that the set of prime divisors of k is equal to the set of prime divisors of sigma(k).at n=17A027598
• Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 19 (most significant digit on right).at n=30A029512
• Number of reversible strings with n beads of 2 colors. If more than 1 bead, not palindromic.at n=15A032085
• Number of reversible strings with n beads of 4 colors. If more than 1 bead, not palindromic.at n=7A032087
• a(n) = (nextprime(4^n) - nextprime(2^n))/2.at n=8A037131
• Sum of every 4th entry of row n in Pascal's triangle, starting at binomial(n,2).at n=17A038505
• Number of elements of GF(2^n) with trace 0 and subtrace 1.at n=17A038519
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=17A038521
• Maximum number of distinct functions at the bottom of a Boolean (or Binary) Decision Diagram (or BDD) with negation by pointer complementation.at n=3A040996
• 1 / min{1/n - 1/a - 1/b > 0}, where a and b are integers.at n=14A045470
• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=35A050047