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!)
A022374 Fibonacci sequence beginning 2, 24. 2

%I #25 May 10 2021 01:06:13

%S 2,24,26,50,76,126,202,328,530,858,1388,2246,3634,5880,9514,15394,

%T 24908,40302,65210,105512,170722,276234,446956,723190,1170146,1893336,

%U 3063482,4956818,8020300,12977118,20997418,33974536,54971954,88946490,143918444,232864934,376783378,609648312

%N Fibonacci sequence beginning 2, 24.

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

%F Equals 2*A022102(n). - _Bruno Berselli_, Oct 05 2017

%F a(n) = a(n-1)+a(n-2). - _Wesley Ivan Hurt_, May 10 2021

%t LinearRecurrence[{1,1}, {2,24}, 50] (* _G. C. Greubel_, Oct 04 2017 *)

%o (PARI) x='x+O('x^50); Vec((2+22*x)/(1-x-x^2)) \\ _G. C. Greubel_, Oct 04 2017

%Y Cf. A022102.

%K nonn

%O 0,1

%A _N. J. A. Sloane_

%E Terms a(30) onward added by _G. C. Greubel_, Oct 04 2017

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 18 16:22 EDT 2024. Contains 371780 sequences. (Running on oeis4.)