This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2017 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022359 Fibonacci sequence beginning 0, 25. 2
 0, 25, 25, 50, 75, 125, 200, 325, 525, 850, 1375, 2225, 3600, 5825, 9425, 15250, 24675, 39925, 64600, 104525, 169125, 273650, 442775, 716425, 1159200, 1875625, 3034825, 4910450, 7945275, 12855725, 20801000, 33656725, 54457725, 88114450, 142572175, 230686625 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (1,1). FORMULA G.f.: 25*x/(1 - x - x^2). - Philippe Deléham, Nov 20 2008 a{n) = (-25/2)*(Fibonacci(n) - Lucas(n)). - Harvey P. Dale, Nov 22 2012 a(n) = Lucas(n+5) + Lucas(n-5), with Lucas(-i) = (-1)^i*Lucas(i) for the negative indices. - Bruno Berselli, Dec 27 2016 MATHEMATICA LinearRecurrence[{1, 1}, {0, 25}, 30] (* or *) Table[(-25/2)(Fibonacci[n] - LucasL[n]), {n, 50}] (* Harvey P. Dale, Nov 22 2012 *) PROG (MAGMA) [Lucas(n+5)+Lucas(n-5): n in [0..40]]; // Bruno Berselli, Dec 27 2016 (PARI) for(n=0, 50, print1(25*fibonacci(n), ", ")) \\ G. C. Greubel, Aug 26 2017 CROSSREFS Sequence in context: A247650 A090092 A040601 * A147491 A147507 A146865 Adjacent sequences:  A022356 A022357 A022358 * A022360 A022361 A022362 KEYWORD nonn,easy AUTHOR 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.

Last modified December 10 12:33 EST 2018. Contains 318047 sequences. (Running on oeis4.)