# Finding an explicit formula for this recurrence relation [closed]

I have the recurrence relation $a_{n}=2a_{n-1}^{2}-1$ with the initial term $a_{0}=3$. The first few terms in this sequence are $3,17,577,665857,\dots$

Does anyone know how to find an explicit formula for this relation?

## closed as off-topic by heropup, abiessu, José Carlos Santos, John B, rtybaseJan 5 '18 at 22:56

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – heropup, abiessu, José Carlos Santos, John B, rtybase
If this question can be reworded to fit the rules in the help center, please edit the question.

• If $a=\cosh t$ then $2a^2-1=\cosh2t$ etc. – Lord Shark the Unknown Jan 5 '18 at 15:46
• One thing I see is that $3=2+1,17=2^4+1$, and we have $$2(2^k+1)^2-1=2^{2k+1}+2^{k+2}+1$$ but this doesn't immediately lend itself to a nice formula... – abiessu Jan 5 '18 at 15:48
• Lord Shark of the Unknown's comment above is the key to solving this. Set $a_n = \cosh t_n$. – John Barber Jan 5 '18 at 16:04

$a_n = \frac{1}{2}((1 + \sqrt2)^{2^n} + (1 - \sqrt2)^{2^n})$