1721868840

Appears in sequences

• a(n) = (1/2)*n*(n-1)*3^(n-1).at n=16A129530
• a(n) = Sum_{k=0..3^(n-1)} gcd(k,3^(n-1)) for n > 0 and a(0) = 1.at n=18A199923
• Largest number m such that repeated application of A235600 takes n steps to reach 1, where A235600(k) = k/A007953(k) if the digital sum A007953(k) divides k, A235600(k) = k otherwise.at n=7A236385