452984832

Appears in sequences

• a(n) = (n+2)*2^(n-1).at n=25A001792
• a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,2*k) = floor(n*2^(n-3)).at n=27A049610
• a(n) = (3^3)*4^(n-3) with a(0)=1, a(1)=1 and a(2)=7.at n=15A056120
• Write n in decimal, omit 0's, raise each digit k to k-th power and multiply.at n=38A061510
• Denominators in partial products of the twin prime constant.at n=6A062271
• a(1)=1, then a(n)=3*a(n-1) if n is already in the sequence, a(n)=2*a(n-1) otherwise.at n=27A079352
• Smallest number beginning with 4 and having exactly n prime divisors counted with multiplicity.at n=26A106424
• A007318 * A143097.at n=25A143099
• Numbers that are products of distinct terms in A000312.at n=32A156223
• A001792*A008683.at n=25A156827
• Inverse binomial transform of A026741.at n=27A168150
• a(n) = 27*2^n.at n=24A175806
• Numbers representable as x^x * y^y, with x > y > 1.at n=14A228174
• a(n) = 27*8^n.at n=8A272342
• Multiply a(n) by the first digit of a(n+1) to get a(n+2). The sequence starts with a(1) = 1 and a(2) = 2.at n=27A300759
• Multiply a(n) by the first digit of a(n+1) to get a(n+2). The sequence starts with a(1) = 1 and a(2) = 2.at n=29A300759