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!)
A022399 Fibonacci sequence beginning 1, 29. 1

%I #28 Feb 18 2024 02:01:54

%S 1,29,30,59,89,148,237,385,622,1007,1629,2636,4265,6901,11166,18067,

%T 29233,47300,76533,123833,200366,324199,524565,848764,1373329,2222093,

%U 3595422,5817515,9412937,15230452,24643389,39873841,64517230,104391071,168908301,273299372,442207673

%N Fibonacci sequence beginning 1, 29.

%H G. C. Greubel, <a href="/A022399/b022399.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.: (1+28*x)/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008

%t Table[Fibonacci[n+2] + 27*Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 01 2018 *)

%t LinearRecurrence[{1,1},{1,29},40] (* _Harvey P. Dale_, Dec 30 2022 *)

%o (PARI) for(n=0, 40, print1(fibonacci(n+2) + 27*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 01 2018

%o (Magma) [Fibonacci(n+2) + 27*Fibonacci(n): n in [0..40]]; // _G. C. Greubel_, Mar 01 2018

%K nonn

%O 0,2

%A _N. J. A. Sloane_

%E Terms a(30) onward added by _G. C. Greubel_, Mar 01 2018

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 April 24 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)