login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


a(n) = (1/5)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*5^k.
3

%I #28 Mar 27 2024 08:59:46

%S 1,7,68,609,5555,50456,458737,4169823,37904764,344559985,3132110411,

%T 28471412592,258809985953,2352626740919,21385776919540,

%U 194400346514241,1767132187070947,16063531893267208,146020234807218449,1327348749622606095,12065825708695393196

%N a(n) = (1/5)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*5^k.

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

%F a(n) = 7*a(n-1) + 19*a(n-2).

%F G.f.: 1 / (-19*x^2-7*x+1). - _Colin Barker_, Aug 08 2013

%t LinearRecurrence[{7,19},{1,7},25] (* _Paolo Xausa_, Jan 07 2024 *)

%o (Sage) [lucas_number1(n,7,-19) for n in range(1, 20)] # _Zerinvary Lajos_, Apr 29 2009

%Y Cf. A014445, A057088, A015553.

%K nonn,easy

%O 0,2

%A _Benoit Cloitre_, Oct 25 2003

%E More terms from _Colin Barker_, Aug 08 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 18:10 EDT 2024. Contains 376182 sequences. (Running on oeis4.)