2883584

Appears in sequences

• a(n) = 11*4^n.at n=9A002089
• Coefficients for numerical differentiation.at n=5A002553
• a(n) = 11*2^n.at n=18A005015
• Number of 1's in all compositions of n+1.at n=19A045623
• a(n) is the greatest common divisor of (n-1)! and n^n.at n=21A062763
• 19-almost primes (generalization of semiprimes).at n=9A069280
• Smallest Smith number with n prime factors.at n=17A104168
• 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=11A104169
• Numbers of the form (8^i)*(11^j), with i, j >= 0.at n=29A107788
• a(0)=44; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=32A108213
• a(0)=44; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).at n=35A108213
• Binomial transform of abs(A134967).at n=19A135035
• 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=38A160825
• Numbers which can be expressed as the product of numbers made of only eights.at n=31A161146
• Numbers with 38 divisors.at n=3A175747
• a(n) = n*2^(n-5).at n=17A196410
• Denominator of Bernoulli(2*n,1/2) / Period of length 2: repeat 12, 60.at n=9A212655
• Numbers that are not the sum of two squares and two fourth powers.at n=32A214891
• Square array read by antidiagonals upwards: the n-th row o.g.f. is exp( Sum_{i >= 1} d(n,i+1)*x^i/i ) for n >= 1, where d(n,k) is Shanks's array of generalized Euler and class numbers.at n=24A262144
• a(n) = nim-product of 2^4 and 2^n.at n=21A335161