301989888

Appears in sequences

• a(n) = 9*2^n.at n=25A005010
• Reciprocal of n terminates with an infinite repetition of digit 5. Multiples of 10 are omitted.at n=5A064564
• Smallest number beginning with 3 and having exactly n prime divisors counted with multiplicity.at n=26A106423
• Third smallest number with exactly n prime factors.at n=26A116453
• a(n) = floor(2^(n-2)*3*n).at n=23A128543
• Least number of the form semiprime - 1 which is the product of exactly n primes.at n=26A128686
• a(n) = 2*a(n-1) + 2^(n-1), for n > 0, with a(0)=6.at n=24A159694
• Odd powers of 2 and 9 times odd powers of 2, sorted.at n=26A190787
• Denominators of partial products of a Hardy-Littlewood constant.at n=8A191997
• a(n) = 2^(2*n+1) * (2*n+1)*n^(2*n).at n=3A217971
• Number of defective 3-colorings of an n X 2 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=12A229504
• Coefficients in the expansion of 1/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = 3/2.at n=28A279634
• a(n) = Product_{k=1..n} d(2*k - 1), where d() is the number of divisors function A000005.at n=21A334764
• a(n) is the least number of the form p^2 + q^2 - 2 for primes p and q that is an odd multiple of 2^n, or -1 if there is no such number.at n=25A359439