Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067431
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067431 Convolution of Fibonacci F(n+1), n>=0, with F(n+8), n>=0. +0
1
21, 55, 131, 275, 550, 1058, 1985, 3653, 6625, 11875, 21084, 37140, 64989, 113075, 195775, 337507, 579650, 992182, 1693225, 2881825, 4892861, 8288915, 14013816, 23649000, 39841125, 67014703, 112558715 (list; graph; listen)
OFFSET

0,1

COMMENT

Eighth diagonal of A067330. Eighth column of A067418.

FORMULA

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

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

a(n)= ((76*n+5*21)*F(n+1)+47*(n+1)*F(n))/5, F(n) := A000045(n) (Fibonacci); 21=F(8), 76=L(9), 47=L(8), L(n) := A000204(n) (Lucas).

CROSSREFS

Adjacent sequences: A067428 A067429 A067430 this_sequence A067432 A067433 A067434

Sequence in context: A039310 A043913 A007796 this_sequence A083676 A067727 A043382

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