Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087426
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087426 a(n)=S(n,4) where S(n,m)=sum(k=0,n,binomial(n,k)*Fibonacci(m*k)). +0
1
0, 3, 27, 216, 1701, 13365, 104976, 824499, 6475707, 50860872, 399466485, 3137450517, 24641856288, 193539651939, 1520080160859, 11938864580280, 93769059774789, 736471756750581, 5784324272782128, 45430672644283923 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=9*a(n-1)-9*a(n-2); a(n)=1/sqrt(5)*((9+3*sqrt(5))/2)^n)-1/sqrt(5)*((9-3*sqrt(5))/2)^n

a(n)=3^n*F(2n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 13 2005

CROSSREFS

Cf. A001906 (S(n, 1)), A030191 (S(n, 2)).

Sequence in context: A127222 A118996 A043023 this_sequence A083713 A065100 A035088

Adjacent sequences: A087423 A087424 A087425 this_sequence A087427 A087428 A087429

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 23 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research