|
Search: id:A084330
|
|
|
| A084330 |
|
a(0)=0, a(1)=1, a(n)=31a(n-1)-29a(n-2). |
|
+0
1
|
|
| 0, 1, 31, 932, 27993, 840755, 25251608, 758417953, 22778659911, 684144336604, 20547893297305, 617144506454939, 18535590794481264, 556706123941725953, 16720357709153547887, 502186611389449931860, 15082894579507494998937, 453006320234438296943107
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(n)=(1/13)*sum(k=0, n, binomial(n, k)*F(7*k)) where F(k) denotes the k-th Fibonacci number.
a(n)=(1/65)*[31/2+(13/2)*sqrt(5)]^n*sqrt(5)-(1/65)*sqrt(5)*[31/2-(13/2)*sqrt(5)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 17 2008
|
|
MAPLE
|
f:=proc(n) option remember; if n <=1 then n else 31*f(n-1)-29*f(n-2); fi; end;
|
|
PROGRAM
|
(PARI) a(n)=(1/13)*sum(k=0, n, binomial(n, k)*fibonacci(7*k))
|
|
CROSSREFS
|
Cf. A030191.
Sequence in context: A051587 A069380 A006111 this_sequence A009975 A042862 A138958
Adjacent sequences: A084327 A084328 A084329 this_sequence A084331 A084332 A084333
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 21 2003
|
|
EXTENSIONS
|
Corrected by njas, Sep 16 2005
|
|
|
Search completed in 0.002 seconds
|
