130459631616domain: NAppears in sequencesa(n) = phi(a(n-1)) * number of divisors of a(n-1), a(1)=3.at n=14A063506a(n) = phi(3^n+1), where phi is Euler's totient function (A000010).at n=24A366579a(n) = phi(9^n+1), where phi is Euler's totient function (A000010).at n=12A366667