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!)
A087426 a(n) = S(n,4) where S(n,m) = sum(k=0,n,binomial(n,k)*Fibonacci(m*k)). 0
0, 3, 27, 216, 1701, 13365, 104976, 824499, 6475707, 50860872, 399466485, 3137450517, 24641856288, 193539651939, 1520080160859, 11938864580280, 93769059774789, 736471756750581, 5784324272782128, 45430672644283923 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
M. Griffiths, Families of Sequences From a Class of Multinomial Sums, J. Int. Seq. 15 (2012) # 12.1.8
FORMULA
a(n) = 9*a(n-1)-9*a(n-2).
a(n) = (1/sqrt(5))*(((9+3*sqrt(5))/2)^n-((9-3*sqrt(5))/2)^n).
a(n) = 3^n*F(2n). - Benoit Cloitre, Sep 13 2005
G.f.: 3*x / (9*x^2-9*x+1). - Colin Barker, Jun 26 2013
CROSSREFS
Cf. A001906 (S(n,1)), A030191 (S(n,2)).
Sequence in context: A043023 A198686 A357662 * A145608 A083713 A230179
KEYWORD
nonn,easy
AUTHOR
Benoit Cloitre, Oct 23 2003
STATUS
approved

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 September 18 07:05 EDT 2024. Contains 375996 sequences. (Running on oeis4.)