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!)
A112845 Recurrence a(n) = a(n-1)^3 - 3*a(n-1) with a(0) = 6. 7
6, 198, 7761798, 467613464999866416198, 102249460387306384473056172738577521087843948916391508591105798 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Identical to A006243 apart from the initial term. For some general remarks on this recurrence see A001999. - Peter Bala, Nov 13 2012
LINKS
E. B. Escott, Rapid method for extracting a square root, Amer. Math. Monthly, 44 (1937), 644-646.
N. J. Fine, Infinite products for k-th roots, Amer. Math. Monthly Vol. 84, No. 8, Oct. 1977, 629-630.
Eric Weisstein's World of Mathematics, Pierce Expansion
FORMULA
a(n) = -2*cos(3^n*arccos(-3)).
From Peter Bala, Nov 13 2012: (Start)
a(n) = (3 + 2*sqrt(2))^(3^n) + (3 - 2*sqrt(2))^(3^n).
Product {n = 0..inf} (1 + 2/(a(n) - 1)) = sqrt(2).
(End)
MATHEMATICA
RecurrenceTable[{a[n] == a[n - 1]^3 - 3*a[n - 1], a[0] == 6}, a, {n,
0, 5}] (* G. C. Greubel, Dec 30 2016 *)
CROSSREFS
Cf. A006243. - R. J. Mathar, Aug 15 2008
Sequence in context: A351888 A340557 A305167 * A109058 A274481 A256799
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Sep 21 2005
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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)