This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 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!)
 A022363 Fibonacci sequence beginning 0, 29. 2

%I

%S 0,29,29,58,87,145,232,377,609,986,1595,2581,4176,6757,10933,17690,

%T 28623,46313,74936,121249,196185,317434,513619,831053,1344672,2175725,

%U 3520397,5696122,9216519,14912641,24129160,39041801,63170961,102212762,165383723

%N Fibonacci sequence beginning 0, 29.

%H G. C. Greubel, <a href="/A022363/b022363.txt">Table of n, a(n) for n = 0..1000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

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

%F G.f.: 29*x/(1-x-x^2). - _Philippe DelĂ©ham_, Nov 20 2008

%F a(n) = Fibonacci(n+7) - Fibonacci(n-7), where Fibonacci(-7..-1) = 13, -8, 5, -3, 2, -1, 1. - _Bruno Berselli_, May 22 2015

%t Table[29 Fibonacci(n), {n, 0, 40}] (* _Bruno Berselli_, May 22 2015 *)

%o (MAGMA) [29*Fibonacci(n): n in [0..40]]; // _Bruno Berselli_, May 22 2015

%o (PARI) for(n=0,50, print1(29*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017

%Y Cf. A000045.

%Y Cf. similar sequences listed in A258160.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_

%E More terms from _Bruno Berselli_, May 22 2015

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 17 02:31 EST 2018. Contains 318192 sequences. (Running on oeis4.)