Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067333
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067333 Convolution of Fibonacci F(n+1), n>=0, with F(n+5), n>=0. +0
1
5, 13, 31, 65, 130, 250, 469, 863, 1565, 2805, 4980, 8772, 15349, 26705, 46235, 79705, 136886, 234302, 399845, 680515, 1155385, 1957293, 3309096, 5584200, 9407525, 15823765, 26577559, 44579633, 74681770 (list; graph; listen)
OFFSET

0,1

COMMENT

Fifth diagonal of A067330. Fifth column of A067418.

FORMULA

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

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

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

CROSSREFS

Sequence in context: A023261 A165888 A109419 this_sequence A118646 A097969 A082280

Adjacent sequences: A067330 A067331 A067332 this_sequence A067334 A067335 A067336

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research