|
Search: id:A084328
|
|
|
| A084328 |
|
a(0)=0 a(1)=1 a(n)=13a(n-1)-11a(n-2). |
|
+0
1
|
|
| 0, 1, 13, 158, 1911, 23105, 279344, 3377317, 40832337, 493669894, 5968552915, 72160819061, 872436565728, 10547906344793, 127525980259301, 1541810773578190, 18640754273664159, 225369887048273977
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(n)=(1/5)*sum(k=0, n, binomial(n, k)*F(5*k)) where F(k) denotes the k-th Fibonacci number.
a(n)=-(1/25)*[13/2-(5/2)*sqrt(5)]^n*sqrt(5)+(1/25)*sqrt(5)*[13/2+(5/2)*sqrt(5)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 19 2008
|
|
PROGRAM
|
(PARI) a(n)=(1/5)*sum(k=0, n, binomial(n, k)*fibonacci(5*k))
(Other) sage: [lucas_number1(n, 13, 11) for n in xrange(0, 18)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 29 2009]
|
|
CROSSREFS
|
Cf. A030191.
Sequence in context: A165151 A016125 A015470 this_sequence A000830 A118673 A133180
Adjacent sequences: A084325 A084326 A084327 this_sequence A084329 A084330 A084331
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 21 2003
|
|
|
Search completed in 0.005 seconds
|
