%I #52 Mar 30 2023 04:44:35
%S 2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,
%T 17711,28657,46368,75025,121393,196418,317811,514229,832040,1346269,
%U 2178309,3524578,5702887,9227465,14930352,24157817,39088169,63245986,102334155,165580141
%N Pisot sequence E(2,3).
%C Pisano period lengths: A001175. - _R. J. Mathar_, Aug 10 2012
%H Colin Barker, <a href="/A020695/b020695.txt">Table of n, a(n) for n = 0..1000</a>
%H Mohammad K. Azarian, <a href="http://www.m-hikari.com/ijcms/ijcms-2012/37-40-2012/azarianIJCMS37-40-2012.pdf">Fibonacci Identities as Binomial Sums</a>, International Journal of Contemporary Mathematical Sciences, Vol. 7, No. 38, 2012, pp. 1871-1876 (See Corollary 1 (x)).
%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 a(n) = Fibonacci(n+3); a(n) = a(n-1) + a(n-2).
%F G.f.: (2+x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F a(n) = (2^(-n)*((1-sqrt(5))^n*(-2+sqrt(5))+(1+sqrt(5))^n*(2+sqrt(5))))/sqrt(5). - _Colin Barker_, Jun 05 2016
%F E.g.f.: 2*(2*sqrt(5)*sinh(sqrt(5)*x/2) + 5*cosh(sqrt(5)*x/2))*exp(x/2)/5. - _Ilya Gutkovskiy_, Jun 05 2016
%t CoefficientList[Series[(-x - 2)/(x^2 + x - 1), {x, 0, 200}], x] (* _Vladimir Joseph Stephan Orlovsky_, Jun 11 2011 *)
%t LinearRecurrence[{1,1},{2,3},40] (* or *) Fibonacci[Range[3,50]] (* _Harvey P. Dale_, Nov 22 2012 *)
%o (Magma) [Fibonacci(n+3): n in [0..50]]; // _Vincenzo Librandi_, Apr 23 2011
%o (PARI) a(n)=fibonacci(n+3) \\ _Charles R Greathouse IV_, Jan 17 2012
%o (PARI) Vec((2+x)/(1-x-x^2) + O(x^40)) \\ _Colin Barker_, Jun 05 2016
%o (GAP)
%o A020695:=List([0..10^3], n->Fibonacci(n+3)); # _Muniru A Asiru_, Sep 05 2017
%Y Subsequence of A000045. See A008776 for definitions of Pisot sequences.
%Y See A000045 for the Fibonacci numbers.
%K nonn,easy
%O 0,1
%A _David W. Wilson_