|
| |
|
|
A094704
|
|
Convolution of Fibonacci(n) and 10^n.
|
|
2
| |
|
|
0, 1, 11, 112, 1123, 11235, 112358, 1123593, 11235951, 112359544, 1123595495, 11235955039, 112359550534, 1123595505573, 11235955056107, 112359550561680, 1123595505617787, 11235955056179467, 112359550561797254
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| The convolution of Fibonacci(n) and k^n for k>1 has a(n)=((1/2-sqrt(5)/2)^n((k+2)sqrt(5)/10-k/2)- (1/2+sqrt(5)/2)^n((k+2)sqrt(5)/10+k/2)+k^(n+1))/(k^2-k-1).
|
|
|
FORMULA
| G.f. : x/((1-x-x^2)(1-10x)); a(n)=10^(n+1)/89+(1/2-sqrt(5)/2)^n(6sqrt(5)/445-5/89)-(1/2+sqrt(5)/2)^n(6sqrt(5)/445+5/89).
If first term is omitted: a(n)=10a(n-1)+F(n) with a(0)=0 and F(n) is the n-th Fibonacci number [From M. Dols (markdols99(AT)yahoo.com), Aug 31 2009]
|
|
|
CROSSREFS
| Cf. A019523.
Sequence in context: A065834 A104720 A132926 * A019523 A132939 A059996
Adjacent sequences: A094701 A094702 A094703 * A094705 A094706 A094707
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Paul Barry (pbarry(AT)wit.ie), May 21 2004
|
| |
|
|
