|
| |
|
|
A165900
|
|
Values of Fibonacci polynomial n^2-n-1.
|
|
4
| |
|
|
-1, -1, 1, 5, 11, 19, 29, 41, 55, 71, 89, 109, 131, 155, 181, 209, 239, 271, 305, 341, 379, 419, 461, 505, 551, 599, 649, 701, 755, 811, 869, 929, 991, 1055, 1121, 1189, 1259, 1331, 1405, 1481, 1559, 1639, 1721, 1805, 1891, 1979, 2069, 2161, 2255
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| a(n) = - A188652(2*n) for n > 0. [Reinhard Zumkeller, Apr 13 2011]
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
J. J. Heed and L Kelly, An interesting sequence of Fibonacci sequence generators, Fibonacci Quarterly, 13 (1975), pp. 29-30.
Index to sequences with linear recurrences with constant coefficients, signature (3,-3,1).
|
|
|
FORMULA
| a(n+2)= (n+1)a(n+1)-(n+2)a(n). G.f.: (x^2+2x-1)/(1-x)^3. E.g.f.: exp(x)(x^2-1).
|
|
|
MATHEMATICA
| Table[n^2 - n - 1, {n, 1, 50}] [From Ron Knott (enquiry(AT)ronknott.com), Oct 27 2010]
|
|
|
PROG
| (PARI) a(n)=n^2-n-1 \\ Charles R Greathouse IV, Jan 12 2012
|
|
|
CROSSREFS
| A028387 and A110331 are very similar sequences.
Sequence in context: A108151 A088059 A028387 * A110331 A106071 A073847
Adjacent sequences: A165897 A165898 A165899 * A165901 A165902 A165903
|
|
|
KEYWORD
| sign,easy
|
|
|
AUTHOR
| Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 29 2009
|
|
|
EXTENSIONS
| a(22) corrected by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 13 2011
|
| |
|
|
