|
Search: id:A136376
|
|
|
| A136376 |
|
a(n) = n*F(n) + (n-1)*F(n-1). |
|
+0
2
|
|
| 1, 3, 8, 18, 37, 73, 139, 259, 474, 856, 1529, 2707, 4757, 8307, 14428, 24942, 42941, 73661, 125951, 214739, 365166, 619508, 1048753, 1771943, 2988457, 5031843, 8459504, 14201994, 23811349, 39873841, 66695539, 111440227, 186016962
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For n>2, mod 2 = (0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1,...), i.e. two evens followed by four odds, (repeating).
|
|
FORMULA
|
a(n) = n*F(n) + (n-1)*F(n-1). Equals the matrix product A128064 (unsigned) * A000045.
|
|
EXAMPLE
|
a(5) = 37 = a(n)*F(n) + (n-1)*F(n-1) = 5*5 + 4*3 = 25 + 12.
|
|
MATHEMATICA
|
Table[n*Fibonacci[n] + (n - 1)*Fibonacci[n - 1], {n, 1, 50}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 28 2007
|
|
CROSSREFS
|
Cf. A000045, A128064.
Sequence in context: A036628 A004035 A000234 this_sequence A099845 A036635 A000713
Adjacent sequences: A136373 A136374 A136375 this_sequence A136377 A136378 A136379
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 28 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 28 2007
|
|
|
Search completed in 0.002 seconds
|
