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!)
A087579 a(n) = (1/6)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*6^k. 1

%I #24 Mar 26 2024 14:45:47

%S 1,8,93,976,10505,112344,1203397,12885152,137979729,1477507240,

%T 15821470061,169419470448,1814178395353,19426591805816,

%U 208023907911765,2227562425662784,23853192734743457,255424852222168392,2735141407084907389,29288451971122142480

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

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

%F a(n) = 8*a(n-1) + 29*a(n-2).

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

%t Join[{b=1},a=0;Table[c=8*b+29*a;a=b;b=c,{n,30}]] (* _Vladimir Joseph Stephan Orlovsky_, Apr 22 2011 *)

%t LinearRecurrence[{8,29},{1,8},20] (* _Harvey P. Dale_, Mar 22 2019 *)

%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 | 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 23 07:42 EDT 2024. Contains 371905 sequences. (Running on oeis4.)