Search: a006243 -id:a006243
|
|
A112845
|
|
Recurrence a(n) = a(n-1)^3 - 3*a(n-1) with a(0) = 6.
|
|
+10
7
|
|
|
|
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
|
|
|
FORMULA
|
a(n) = -2*cos(3^n*arccos(-3)).
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,
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A006242
|
|
Extracting a square root.
(Formerly M4758)
|
|
+10
4
|
|
|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A282180
|
|
a(n+1) = a(n)*(a(n)^2 - 3) with a(0) = 8.
|
|
+10
1
|
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.009 seconds
|