9261023232

Appears in sequences

• a(n) = n*(n-1)*2^n.at n=24A128796
• a(n) = 2^n*(3*n^2 + 13*n + 8)/8.at n=25A136530
• a(n) is the smallest number which can be represented as the sum of n n-almost primes in exactly n ways, or -1 if no such number exists.at n=27A365493
• a(1)= 2. For n > 1, a(n) is the least number k such that k, k - a(n-1) and k + a(n-1) all have n prime divisors counted by multiplicity.at n=28A365852