5767168

Appears in sequences

• a(n) = 11*2^n.at n=19A005015
• a(n) is the smallest number such that a(n)+1 is a prime and the largest power of 2 which divides it is 2^n.at n=19A057777
• Number of subsets of {2,...,n} such that the product of their elements is congruent to 0 (mod n+1).at n=22A064381
• 20-almost primes (generalization of semiprimes).at n=9A069281
• a(n) = n*2^(n-4).at n=18A079859
• a(0) = a(1) = 1; for n > 1, a(n) = (n+2)*2^(n-2).at n=20A087447
• Smallest Smith number with n prime factors.at n=18A104168
• Highly decomposable Smith numbers. A Smith number which sets a record for the number of prime factors (counting multiplicity) starting from first Smith number is called a highly decomposable Smith number.at n=12A104169
• a(0)=44; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=34A108213
• a(0)=44; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=37A108213
• First differences of A129952.at n=20A129953
• a(1) = 1. For n >=2, a(n) = the smallest integer > a(n-1) such that both a(n) and a(n)-a(n-1) have the same number of (non-leading) 0's when they are represented in binary.at n=40A160825
• Denominators of the column sums of the EG1 matrix coefficients.at n=10A162442
• Number of singly defective permutations of 1..n with exactly 1 maximum.at n=15A183264
• a(n) = the number of hills (arch length of 1 with no covering arches) for semi-meander solutions with n arches and floor((n+2)/2) arch group returns to the x axis.at n=39A262258
• Number of compositions of partitions of 2n with exactly n compositions.at n=15A327550