27776

Appears in sequences

• Total preorders.at n=6A006326
• Weight distribution of extended Hamming code of length 32 (or 3rd-order Reed-Muller code).at n=3A010081
• Weight distribution of extended Hamming code of length 32 (or 3rd-order Reed-Muller code).at n=13A010081
• Triangle T(n,k)of numbers of asymmetric Boolean functions of n variables with exactly k = 0..2^n nonzero values (atoms) under action of complementing group C(n,2).at n=40A022619
• Sum_{i=0..3} binomial(Fibonacci(n),i).at n=10A032440
• Triangle T(n,k) read by rows; related to number of preorders.at n=34A079502
• Number of permutations in the symmetric group S_n such that the size of their conjugacy class is odd.at n=10A088042
• a(n) = 2*a(n-1) + 12*a(n-2).at n=7A091914
• a(n) = (4*n^3 + 6*n^2 + 8*n + 6)/3.at n=27A100504
• Numbers of the form (24*x + 1)*2^(y+6) with positive integers x and y.at n=15A231203
• Product of the sum of the divisors of n and the sum of the divisors of n-th prime.at n=47A272173
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 189", based on the 5-celled von Neumann neighborhood.at n=14A279719
• Total volume of all rectangular prisms with dimensions q, p+q and |q-p| such that p and q are prime, n = p+q and p < q.at n=31A303231
• Numbers whose product of prime indices is twice their sum of prime indices.at n=33A326151
• Number of integer partitions of n without all distinct multiplicities.at n=39A336866
• Numbers m such that the equation m = k*sigma(k) has more than one solution.at n=3A337873
• Integers that can be written m = k*sigma(k) = q*sigma(q) where (k, q) is a primitive solution of this equation and sigma(m) is the sum of divisors of (m).at n=2A337875
• Number of zeroless strictly pandigital numbers divisible by the n-th prime.at n=5A339498
• Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.at n=42A340312
• Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.at n=62A340312