Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082761
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082761 Trinomial transform of the Fibonacci numbers (A000045). +0
3
1, 4, 20, 104, 544, 2848, 14912, 78080, 408832, 2140672, 11208704, 58689536, 307302400, 1609056256, 8425127936, 44114542592, 230986743808, 1209462292480, 6332826779648, 33159111507968, 173623361929216, 909103725543424 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = Sum[ Trinomial[n, k] Fibonacci[k+1], {k, 0, 2n} ] where Trinomial[n, k] = trinomial coefficients (A027907)

a(n) = 2^n Fibonacci[2n+1]

Third binomial transform of (1, 1, 5, 5, 25, 25, ....). a(n)=((1+sqrt(5))(3+sqrt(5))^n-(1-sqrt(5))(3-sqrt(5))^n)/(2sqrt(5)). - Paul Barry (pbarry(AT)wit.ie), Jul 16 2003

CROSSREFS

Sequence in context: A103771 A005054 A105480 this_sequence A076035 A120978 A035028

Adjacent sequences: A082758 A082759 A082760 this_sequence A082762 A082763 A082764

KEYWORD

easy,nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), May 21 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research