cp's OEIS Frontend

A320918 Sum of n-th powers of the roots of x^3 + 9*x^2 + 20*x - 1.

%I A320918 #30 Dec 15 2024 04:36:04
%S A320918 3,-9,41,-186,845,-3844,17510,-79865,364741,-1667859,7636046,
%T A320918 -35002493,160633658,-738017016,3394477491,-15629323441,72036344133,
%U A320918 -332346150886,1534759151873,-7093873005004,32817327856690,-151943731458257,704053152985509,-3264786419847751
%N A320918 Sum of n-th powers of the roots of x^3 + 9*x^2 + 20*x - 1.
%C A320918 In general, for integer h, k let
%C A320918   X = (sin^(h+k)(2*Pi/7))/(sin^(h)(4*Pi/7)*sin^(k)(8*Pi/7)),
%C A320918   Y = (sin^(h+k)(4*Pi/7))/(sin^(h)(8*Pi/7)*sin^(k)(2*Pi/7)),
%C A320918   Z = (sin^(h+k)(8*Pi/7))/(sin^(h)(2*Pi/7)*sin^(k)(4*Pi/7)).
%C A320918 then X, Y, Z are the roots of a monic equation
%C A320918     t^3 + a*t^2 + b*t + c = 0
%C A320918 where a, b, c are integers and c = 1 or -1.
%C A320918 Then X^n + Y^n + Z^n, n = 0, 1, 2, ... is an integer sequence.
%C A320918 Instances of such sequences with (h,k) values:
%C A320918   (-3,0), (0,3), (3,-3): gives A274663;
%C A320918   (-3,3), (0,-3): give A274664;
%C A320918   (-2,0), (0,2), (2,-2): give A198636;
%C A320918   (-2,-3), (-1,-2), (2,-1), (3,-1): give A274032;
%C A320918   (-1,-1), (-1,2): give A215076;
%C A320918   (-1,0), (0,1), (1,-1): give A094648;
%C A320918   (-1,1), (0,-1), (1,0): give A274975;
%C A320918   (1,1), (-2,1), (1,-2): give A274220;
%C A320918   (1,2), (-3,1), (2,-3): give A274075;
%C A320918   (1,3): this sequence.
%H A320918 Colin Barker, <a href="/A320918/b320918.txt">Table of n, a(n) for n = 0..1000</a>
%H A320918 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (-9,-20,1).
%F A320918 a(n) = ((sin^4(2*Pi/7))/(sin(4*Pi/7)*sin^3(8*Pi/7)))^n
%F A320918      + ((sin^4(4*Pi/7))/(sin(8*Pi/7)*sin^3(2*Pi/7)))^n
%F A320918      + ((sin^4(8*Pi/7))/(sin(2*Pi/7)*sin^3(4*Pi/7)))^n.
%F A320918 a(n) = -9*a(n-1) - 20*a(n-2) + a(n-3) for n>2.
%F A320918 G.f.: (3 + 18*x + 20*x^2) / (1 + 9*x + 20*x^2 - x^3). - _Colin Barker_, Dec 09 2018
%p A320918 a := proc(n) option remember; if n < 3 then [3, -9, 41][n+1] else
%p A320918 -9*a(n-1) - 20*a(n-2) + a(n-3) fi end: seq(a(n), n=0..32); # _Peter Luschny_, Oct 25 2018
%t A320918 CoefficientList[Series[(3 + 18*x + 20*x^2) / (1 + 9*x + 20*x^2 - x^3) , {x, 0, 50}], x] (* _Amiram Eldar_, Dec 09 2018 *)
%t A320918 LinearRecurrence[{-9,-20,1},{3,-9,41},30] (* _Harvey P. Dale_, Dec 10 2023 *)
%o A320918 (PARI) polsym(x^3 + 9*x^2 + 20*x - 1, 25) \\ _Joerg Arndt_, Oct 24 2018
%o A320918 (PARI) Vec((3 + 18*x + 20*x^2) / (1 + 9*x + 20*x^2 - x^3) + O(x^30)) \\ _Colin Barker_, Dec 09 2018
%Y A320918 Cf. A248417, A274032, A274075.
%K A320918 sign,easy
%O A320918 0,1
%A A320918 _Kai Wang_, Oct 24 2018