login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219165 Recurrence equation a(n+1) = a(n)^4 - 4*a(n)^2 + 2 with a(0) = 6. 3
6, 1154, 1773462177794, 9892082352510403757550172975146702122837936996354 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Bisection of A003423.
LINKS
FORMULA
Let alpha = 3 + 2*sqrt(2). Then a(n) = (alpha)^(4^n) + (1/alpha)^(4^n).
a(n) = A003423(2*n) = A003499(4^n).
Product {n >= 0} ((1 + 2/a(n))/(1 - 2/a(n)^2)) = sqrt(2).
From Peter Bala, Dec 06 2022: (Start)
a(n) = 2*T(4^n,3), where T(n,x) denotes the n-th Chebyshev polynomial of the first kind.
Let b(n) = a(n) - 6. The sequence {b(n)} appears to be a strong divisibility sequence, that is, gcd(b(n),b(m)) = b(gcd(n,m)) for n, m >= 1. (End)
CROSSREFS
Sequence in context: A268043 A190351 A267071 * A185537 A113159 A159717
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Nov 13 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 09:47 EDT 2024. Contains 371779 sequences. (Running on oeis4.)