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

%I #30 Feb 18 2024 03:32:33

%S 3,5,30,115,495,2060,8655,36265,152070,637535,2672955,11206540,

%T 46984395,196985885,825879630,3462568315,14517103095,60864150860,

%U 255177968055,1069854658465,4485453815670,18805634739335,78844173296355,330560693585740,1385902947238995

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

%H Vincenzo Librandi, <a href="/A189739/b189739.txt">Table of n, a(n) for n = 1..100</a>

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

%F G.f.: x*(3-4*x)/(1-3*x-5*x^2). - _Bruno Berselli_, May 24 2011

%t LinearRecurrence[{3,5},{3,5},40]

%o (Maxima) a[1]:3$ a[2]:5$ a[n]:=3*a[n-1]+5*a[n-2]$ makelist(a[n], n, 1, 25); /* _Bruno Berselli_, May 24 2011 */

%o (PARI) Vec(x*(3-4*x)/(1-3*x-5*x^2)+O(x^99)) \\ _Charles R Greathouse IV_, Jul 15 2011

%K nonn,easy

%O 1,1

%A _Harvey P. Dale_, Apr 26 2011

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 25 14:06 EDT 2024. Contains 371987 sequences. (Running on oeis4.)