# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a215455 Showing 1-1 of 1 %I A215455 #24 Apr 29 2020 05:54:12 %S A215455 3,6,18,57,186,621,2109,7251,25146,87726,307293,1079370,3798309, %T A215455 13382817,47191491,166501902,587670810,2074699233,7325660010, %U A215455 25869337773,91359785781,322660334739,1139593274178,4024976418198,14216179376325,50211881768346,177350652641349 %N A215455 a(n) = 6*a(n-1) - 9*a(n-2) + a(n-3), with a(0)=3, a(1)=6 and a(2)=18. %C A215455 The Berndt-type sequence number 1 for the argument 2*Pi/9 (see also A215007, A215008) is connected with the following trigonometric identities: f(n;x)=g(n;x)=const for n=1,2 (and are equal to 6 and 18 respectively), f(n;x)+g(n;x)=const for n=3,4,5 (and are equal to 120, 420 and 1512 respectively). Moreover each of the functions f(3;x), g(3;x) and f(6;x)+g(6;x) is not the constant function. Here f(n;x) := (2*cos(x))^(2n) + (2*cos(x-Pi/3))^(2n) + (2*cos(x+Pi/3))^(2n), and g(n;x) := (2*sin(x))^(2n) + (2*cos(x-Pi/6))^(2n) + (2*cos(x+Pi/6))^(2n), for every n=1,2,..., and x in R (see Witula-Slota paper for details). %H A215455 Andrew Howroyd, Table of n, a(n) for n = 0..500 %H A215455 R. Witula and D. Slota, On modified Chebyshev polynomials, J. Math. Anal. Appl., 324 (2006), 321-343. %H A215455 Index entries for linear recurrences with constant coefficients, signature (6,-9,1). %F A215455 a(n) = c(1)^(2*n) + c(2)^(2*n) + c(4)^(2*n), where c(j) = 2*cos(Pi*j/9). %F A215455 G.f.: 3*(1 - x)*(1 - 3*x)/(1 - 6*x + 9*x^2 - x^3). %F A215455 a(n) = 3*A094831(n). - _Andrew Howroyd_, Apr 28 2020 %e A215455 From the identity c(j)^2 = 2 + c(2*j) we deduce that a(1)=6 is equivalent with c(2) + c(4) + c(8) = 0, where c(j) := 2*cos(Pi*j/9). %t A215455 LinearRecurrence[{6,-9,1}, {3,6,18}, 50] %o A215455 (PARI) Vec((3-12*x+9*x^2)/(1-6*x+9*x^2-x^3)+O(x^99)) \\ _Charles R Greathouse IV_, Sep 27 2012 %Y A215455 Cf. A094831, A215007, A215008. %K A215455 nonn,easy %O A215455 0,1 %A A215455 _Roman Witula_, Aug 11 2012 %E A215455 Terms a(22) and beyond from _Andrew Howroyd_, Apr 28 2020 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE