This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A022088 #62 Apr 13 2025 11:26:06
%S A022088 0,5,5,10,15,25,40,65,105,170,275,445,720,1165,1885,3050,4935,7985,
%T A022088 12920,20905,33825,54730,88555,143285,231840,375125,606965,982090,
%U A022088 1589055,2571145,4160200,6731345,10891545,17622890,28514435,46137325,74651760,120789085
%N A022088 Fibonacci sequence beginning 0, 5.
%D A022088 A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, pp. 15, 34, 52.
%H A022088 G. C. Greubel, <a href="/A022088/b022088.txt">Table of n, a(n) for n = 0..1000</a>
%H A022088 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022088 Kristina Lund, Steven Schlicker and Patrick Sigmon, <a href="http://dx.doi.org/10.2140/involve.2008.1.197">Fibonacci sequences and the space of compact sets</a>, Involve, 1:2 (2008), pp. 159-165.
%H A022088 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022088 a(n) = round( (2*phi-1)*phi^n ) for n>3. - _Thomas Baruchel_, Sep 08 2004
%F A022088 a(n) = 5*Fibonacci(n).
%F A022088 a(n) = A119457(n+3,n-1) for n>1. - _Reinhard Zumkeller_, May 20 2006
%F A022088 G.f.: 5*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022088 a(n+2) = A014217(n+4) - A014217(n). - _Paul Curtz_, Dec 22 2008
%F A022088 a(n) = sqrt(5*(A000032(n)^2 - 4*(-1)^n)). - _Alexander Samokrutov_, Sep 02 2015
%F A022088 From _Tom Copeland_, Jan 25 2016: (Start)
%F A022088 The o.g.f. for the shifted series b(0)=0 and b(n) = a(n+1) is G(x) = 5*x*(1+x)/(1-x*(1+x)) = 5 L(-Cinv(-x)), where L(x) = x/(1-x) with inverse Linv(x) = x/(1+x) and Cinv(x) = x*(1-x), the inverse of the o.g.f. for the shifted Catalan numbers of A000108, C(x) = (1-sqrt(1-4*x))/2. Then Ginv(x) = -C(-Linv(x/5)) = (-1 + sqrt(1+4*x/(5+x)))/2.
%F A022088 a(n+1) = 5*Sum_{k=0..n} binomial(n-k,k) = 5 * A000045(n+1), from A267633, with the convention for zeros of the binomial assumed there. (End)
%F A022088 For n > 0, 1/a(n) = Sum_{k>=1} F(n*k)/(L(n+1)^(k+1)), where F(n) = A000045(n) and L(n) = A000032(n). - _Diego Rattaggi_, Oct 26 2022
%t A022088 LinearRecurrence[{1,1},{0,5},40] (* _Harvey P. Dale_, Jan 13 2012 *)
%t A022088 5*Fibonacci[Range[0, 50]] (* _G. C. Greubel_, Feb 10 2023 *)
%o A022088 (Magma) [5*Fibonacci(n): n in [1..40]]; // _Vincenzo Librandi_, Sep 03 2015
%o A022088 (PARI) a(n) = 5*fibonacci(n); \\ _Michel Marcus_, Sep 03 2015
%o A022088 (SageMath) [5*fibonacci(n) for n in range(51)] # _G. C. Greubel_, Feb 10 2023
%Y A022088 Cf. A000032, A000045, A000108, A014217, A119457, A267633.
%Y A022088 Cf. sequences of the form m*Fibonacci listed in A022086.
%K A022088 nonn,easy
%O A022088 0,2
%A A022088 _N. J. A. Sloane_