Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067331
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067331 Convolution of Fibonacci F(n+1), n>=0, with F(n+3), n>=0. +0
3
2, 5, 12, 25, 50, 96, 180, 331, 600, 1075, 1908, 3360, 5878, 10225, 17700, 30509, 52390, 89664, 153000, 260375, 442032, 748775, 1265832, 2136000, 3598250, 6052061, 10164540, 17048641, 28559450, 47786400 (list; graph; listen)
OFFSET

0,1

COMMENT

Third diagonal of A067330. Third column of A067418.

FORMULA

a(n)= A067330(n+2, n) = A067418(n+2, 2) = sum(F(k+1)*F(n+3-k), k=0..n), n>=0.

a(n)= ((7*n+10)*F(n+1)+4*(n+1)*F(n))/5, with F(n) := A000045(n) (Fibonacci).

G.f.: (2+x)/(1-x-x^2)^2.

CROSSREFS

Adjacent sequences: A067328 A067329 A067330 this_sequence A067332 A067333 A067334

Sequence in context: A116731 A116722 A116730 this_sequence A116734 A101836 A122439

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Feb 15 2002

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 October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research