Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067332
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067332 Convolution of Fibonacci F(n+1), n>=0, with F(n+4), n>=0. +0
1
3, 8, 19, 40, 80, 154, 289, 532, 965, 1730, 3072, 5412, 9471, 16480, 28535, 49196, 84496, 144638, 246845, 420140, 713353, 1208518, 2043264, 3448200, 5809275, 9771704, 16413019, 27530992, 46122320 (list; graph; listen)
OFFSET

0,1

COMMENT

Fourth diagonal of A067330. Fourth column of A067418.

FORMULA

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

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

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

CROSSREFS

Adjacent sequences: A067329 A067330 A067331 this_sequence A067333 A067334 A067335

Sequence in context: A083186 A055341 A007326 this_sequence A082535 A136396 A006380

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 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research