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!)
A106569 a(n) = 5*a(n-1) + 3*a(n-2), where a(0) = 0, a(1) = 3. 2
0, 3, 15, 84, 465, 2577, 14280, 79131, 438495, 2429868, 13464825, 74613729, 413463120, 2291156787, 12696173295, 70354336836, 389860204065, 2160364030833, 11971400766360, 66338095924299, 367604681920575 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 5*a(n-1) + 3*a(n-2), a(0) = 0, a(1) = 3.
a(n) = 3*A015536(n).
G.f.: 3*x/(1 - 5*x - 3*x^2). - G. C. Greubel, Sep 07 2021
MAPLE
a[0]:=0: a[1]:=3: for n from 2 to 23 do a[n]:= 5*a[n-1]+3*a[n-2] od: seq(a[n], n=0..23);
MATHEMATICA
LinearRecurrence[{5, 3}, {0, 3}, 40] (* G. C. Greubel, Sep 07 2021 *)
PROG
(Magma) [n le 2 select 3*(n-1) else 5*Self(n-1) + 3*Self(n-2): n in [1..41]]; // G. C. Greubel, Sep 07 2021
(Sage) [3*lucas_number1(n, 5, -3) for n in (0..40)] # G. C. Greubel, Sep 07 2021
CROSSREFS
Cf. A015536.
Sequence in context: A195885 A115910 A355094 * A260769 A026032 A005809
KEYWORD
nonn,easy,less
AUTHOR
Roger L. Bagula, May 30 2005
EXTENSIONS
Edited by N. J. A. Sloane, Apr 30 2006
New (corrected) name by G. C. Greubel, Sep 07 2021
STATUS
approved

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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)