[go: up one dir, main page]

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!)
Search: a006243 -id:a006243
Displaying 1-3 of 3 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A112845 Recurrence a(n) = a(n-1)^3 - 3*a(n-1) with a(0) = 6. +10
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
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Sep 21 2005
STATUS
approved
A006242 Extracting a square root.
(Formerly M4758)
+10
4
10, 970, 912670090, 760223786832147978143718730, 439363892017598816969702791108195858981800447259539613873486126455827777484460810 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
Jeffrey Shallit, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
E. B. Escott, Rapid method for extracting a square root, Amer. Math. Monthly, 44 (1937), 644-646.
FORMULA
a(1) = 10, a(n) = a(n-1)^3 - 3*a(n-1) [From Escott]. - Sean A. Irvine, Feb 08 2017
a(n) = (5 + 2*sqrt(6))^(3^(n-1)) + (5 - 2*sqrt(6))^(3^(n-1)). - Bruno Berselli, Feb 10 2017
a(n) = 2*T(3^(n-1),5), where T(n,x) deotes the n-th Chebyshev polynomial of the first kind. - Peter Bala, Mar 29 2022
MATHEMATICA
RecurrenceTable[{a[1]==10, a[n]==a[n-1]^3 - 3 a[n-1]}, a, {n, 8}] (* Vincenzo Librandi, Feb 09 2017 *)
PROG
(Magma) [n eq 1 select 10 else Self(n-1)^3-3*Self(n-1): n in [1..5]]; // Vincenzo Librandi, Feb 09 2017
CROSSREFS
Cf. A006243.
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
New offset and a(5) from Sean A. Irvine, Feb 08 2017
STATUS
approved
A282180 a(n+1) = a(n)*(a(n)^2 - 3) with a(0) = 8. +10
1
8, 488, 116212808, 1569502402942700328379688, 3866214585126515728777536857817155683642224883875510905654220958052649608 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
E. B. Escott, Rapid method for extracting a square root, Amer. Math. Monthly, 44 (1937), 644-646.
FORMULA
a(n) = (4 + sqrt(15))^(3^n) + (4 - sqrt(15))^(3^n). - Bruno Berselli, Feb 10 2017
a(n) = -2*cos(3^n * arccos(-4)). - Daniel Suteu, Feb 10 2017
MATHEMATICA
RecurrenceTable[{a[0] == 8, a[n] == a[n-1]^3 - 3 a[n-1]}, a, {n, 8}]
PROG
(Magma) [n eq 1 select 8 else Self(n-1)^3 - 3*Self(n-1): n in [1..6]];
CROSSREFS
Cf. similar sequences with initial value k: A001999 (k=3), A219160 (k=4), A219161 (k=5), A112845 (k=6), A002000 (k=7), this sequence (k=8), A282181 (k=9), A006242 (k=10), A006243 (k=198).
KEYWORD
nonn
AUTHOR
Vincenzo Librandi, Feb 10 2017
STATUS
approved
page 1

Search completed in 0.009 seconds

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 August 30 00:57 EDT 2024. Contains 375520 sequences. (Running on oeis4.)