login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107298 a(n) = 3*a(n-1)-a(n-2)-2*a(n-3)+a(n-4), n>5. 0
3, 2, 5, 10, 25, 56, 128, 288, 649, 1459, 3280, 7371, 16564, 37220, 83634, 187925, 422265, 948822, 2131985, 4790528, 10764220, 24186984, 54347661, 122118087, 274396852, 616564131 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..25.

Index entries for linear recurrences with constant coefficients, signature (3, -1, -2, 1).

FORMULA

G.f.: (-2*x^2-3*x^3+x^5-3+7*x-x^4)/( (x-1)*(x^3-x^2-2*x+1)) . [Sep 28 2009]

MATHEMATICA

NSolve[x^3 - 2*x^2 - x + 1 == 0, x] b1 = -0.8019377358048383 b2 = 0.5549581320873712 b3 = 2.2469796037174667 digits = 25 a = Table[2*(b3^n + b1^n + b2^n)/ (b3 + b2 + b1), {n, 0, digits}] Floor[a]

LinearRecurrence[{3, -1, -2, 1}, {3, 2, 5, 10, 25, 56}, 30] (* Harvey P. Dale, Jun 07 2015 *)

CROSSREFS

Sequence in context: A100885 A209199 A215328 * A195104 A338879 A257905

Adjacent sequences: A107295 A107296 A107297 * A107299 A107300 A107301

KEYWORD

nonn,easy

AUTHOR

Roger L. Bagula, May 20 2005

EXTENSIONS

Definition replaced by recurrence by the Associate Editors of the OEIS, Sep 28 2009

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 December 4 12:54 EST 2022. Contains 358556 sequences. (Running on oeis4.)