Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087567
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087567 a(n)=(1/5)*sum(k=0,n,binomial(n,k)*Fibonacci(k)*5^k). +0
1
1, 7, 68, 609, 5555, 50456, 458737, 4169823, 37904764, 344559985, 3132110411, 28471412592, 258809985953, 2352626740919, 21385776919540, 194400346514241, 1767132187070947, 16063531893267208, 146020234807218449 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=7*a(n-1)+19*a(n-2)

a(n)=-(7/50)*[7/2-(5/2)*sqrt(5)]^n*sqrt(5)+(7/50)*sqrt(5)*[7/2+(5/2)*sqrt(5)]^n+(1/2)*[7/2-(5/2) *sqrt(5)]^n+(1/2)*[7/2+(5/2)*sqrt(5)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 25 2008

PROGRAM

(Other) sage: [lucas_number1(n, 7, -19) for n in xrange(1, 20)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 29 2009]

CROSSREFS

Cf. A014445, A057088, A015553.

Sequence in context: A082698 A093170 A120079 this_sequence A136629 A133697 A122010

Adjacent sequences: A087564 A087565 A087566 this_sequence A087568 A087569 A087570

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 25 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research