Hello,

I am having a bit of trouble finding the pattern in this sequence to turn its recursive form into an explicit form; the problem states:

Let d₁,d₂,d₃,... be the sequence defined by d₁ = 2, and d₂ = 3, and d_n = d_n1 d_n2 for all n N such that n 3. Find an explicit formula for d_n, and prove that your formula works.

Thank you for your help.

All the best