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!)
A019478 a(n) = 5*a(n-1) + a(n-2) - 3*a(n-3). 2

%I #19 Sep 08 2022 08:44:44

%S 3,15,76,386,1961,9963,50618,257170,1306579,6638211,33726124,

%T 171349094,870556961,4422955527,22471287314,114167721214,580041026803,

%U 2946958993287,14972332829596,76068500060858,386473956154025,1963521282342195,9975874867682426,50683473752292250

%N a(n) = 5*a(n-1) + a(n-2) - 3*a(n-3).

%C Agrees with A019477 only for n <= 23.

%D R. K. Guy, personal communication.

%H Vincenzo Librandi, <a href="/A019478/b019478.txt">Table of n, a(n) for n = 0..500</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (5,1,-3).

%F O.g.f.: (3 - 2*x^2)/(1 - 5*x - x^2 + 3*x^3). - _R. J. Mathar_, May 09 2008

%t CoefficientList[Series[(3 - 2 x^2)/(1 - 5 x - x^2 + 3 x^3), {x, 0, 20}], x] (* _Wesley Ivan Hurt_, Jan 21 2017 *)

%o (PARI) Vec((3-2*x^2)/(1-5*x-x^2+3*x^3) + O(x^24)); \\ _Michel Marcus_, Jan 21 2017

%o (Magma) m:=25; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(3-2*x^2)/(1-5*x-x^2+3*x^3)); // _Vincenzo Librandi_, Jan 23 2017

%Y Cf. A019477.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

%E More terms from _Michel Marcus_, Jan 21 2017

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)