|
| |
|
|
A006478
|
|
a(n)=a(n-1)+a(n-2)+F(n)-1, where F() = Fibonacci numbers A000045.
(Formerly M2733)
|
|
9
| |
|
|
1, 3, 8, 18, 38, 76, 147, 277, 512, 932, 1676, 2984, 5269, 9239, 16104, 27926, 48210, 82900, 142055, 242665, 413376, 702408, 1190808, 2014608, 3401833, 5734251, 9650312
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,2
|
|
|
COMMENTS
| Partial sums of A001629.
|
|
|
REFERENCES
| K. J. Overholt, Efficiency of the Fibonacci search method, Nordisk Tidskr. Informationsbehandling (BIT) 13 (1973), 92-96.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (3,-1,-3,1,1).
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
|
FORMULA
| If offset 0: a(n)=1+((n-2)*F(n+2)+(3*n+1)*F(n+3))/5, g.f.: 1/((1-x)*(1-x-x^2)^2).
a(n)=sum(k=0, n-1, sum(i=0, k, F(i)*F(k-i))). - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2003
|
|
|
MAPLE
| A006478:=-1/(z-1)/(z**2+z-1)**2; [S. Plouffe in his 1992 dissertation with offset 0.]
|
|
|
MATHEMATICA
| f[x_] = -1 + 3 x - x^2 - 3 x^3 + x^4 + x^5
Table[SeriesCoefficient[
Series[-1/f[x], {x, 0, 30}], n], {n, 0, 30}]- Roger Bagula ( rlbagulatftn(AT)yahoo.com) Dec 4 2010
|
|
|
CROSSREFS
| Cf. A006479.
Sequence in context: A078409 A036642 A000235 * A104187 A051633 A131051
Adjacent sequences: A006475 A006476 A006477 * A006479 A006480 A006481
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
