|
| |
|
|
A023607
|
|
n * Fibonacci(n+1).
|
|
7
| |
|
|
0, 1, 4, 9, 20, 40, 78, 147, 272, 495, 890, 1584, 2796, 4901, 8540, 14805, 25552, 43928, 75258, 128535, 218920, 371931, 630454, 1066464, 1800600, 3034825, 5106868, 8580897, 14398412, 24129160, 40388070, 67527579, 112786496, 188195271
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Convolution of Fibonacci numbers and Lucas numbers.
a(n) = central term of the triangle in A119457 for n>0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2006
d/dx(1 + x + 2x^2 + 3x^3 + 5x^4 + 8x^5 + ...) = (1 + 4x + 9x^2 + ...). [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 27 2009]
|
|
|
REFERENCES
| M. Griffiths, A Restricted Random Walk defined via a Fibonacci Process, Journal of Integer Sequences, Vol. 14 (2011), #11.5.4.
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (2,1,-2,-1).
|
|
|
FORMULA
| O.g.f.: x(2x+1)/(1-x-x^2)^2. - Len Smiley (smiley(AT)math.uaa.alaska.edu), Dec 11 2001
a(n)=n*sum{k=0..n, binomial(k, n-k)}. - Paul Barry (pbarry(AT)wit.ie), Sep 25 2004
|
|
|
MAPLE
| with (combinat): a:= n-> sum(fibonacci(n+1), j=1..n): seq(a(n), n=0..34); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 25 2007
|
|
|
MATHEMATICA
| Times@@@Thread[{Range[0, 50], Fibonacci[Range[51]]}] (* From Harvey P. Dale *)
Table[n*Fibonacci[n + 1], {n, 0, 50}]
|
|
|
CROSSREFS
| First differences of A094584.
Second column of triangle A016095.
Sequence in context: A060494 A049748 A192956 * A117074 A072934 A084639
Adjacent sequences: A023604 A023605 A023606 * A023608 A023609 A023610
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
EXTENSIONS
| Simpler description from Samuel Lachterman (slachterman(AT)fuse.net), Sep 19 2003
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 20 2004
Name improved by T. D. Noe (noe(AT)sspectra.com), Mar 08 2011
|
| |
|
|
