login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108143 a(n)= 5*a(n-1) -a(n-2) -a(n-3). 0
1, 1, 1, 3, 13, 61, 289, 1371, 6505, 30865, 146449, 694875, 3297061, 15643981, 74227969, 352198803, 1671122065, 7929183553, 37622596897, 178512678867, 847011613885, 4018922793661, 19069089675553, 90479513970219 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

REFERENCES

Roger Bagula, Factoring Double Fibonacci Sequences, 2000

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (5,-1,-1)

FORMULA

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

MATHEMATICA

F[1] = 1; F[2] = 1; F[3] = 1; F[n__] := F[n] = 5*F[n - 1] - F[n - 2] - F[n - 3] a = Table[Abs[F[n]], {n, 1, 50}]

CROSSREFS

Cf. A056015, A056016.

Sequence in context: A104089 A239995 A319924 * A101368 A026704 A046748

Adjacent sequences:  A108140 A108141 A108142 * A108144 A108145 A108146

KEYWORD

nonn,easy

AUTHOR

Roger L. Bagula, Jun 05 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 18:49 EST 2019. Contains 329768 sequences. (Running on oeis4.)