80216064

Appears in sequences

• a(n) = phi(a(n-1)) * number of divisors of a(n-1), a(1)=3.at n=12A063506
• Smallest number beginning with 8 and having exactly n prime divisors counted with multiplicity.at n=21A106428
• a(n) = n*(n-1)*2^n.at n=18A128796