OFFSET
0,3
LINKS
Index entries for linear recurrences with constant coefficients, signature (1, 2, -3, 1).
FORMULA
a(n) = (-1)^n*Fibonacci(n-1) + n. - Vladeta Jovovic, Jul 18 2004
a(n) = A001924(-3-n) = 2*a(n-2) - a(n-3) + 1. - Michael Somos, Dec 31 2012
If 0 is prepended then BINOMIAL transform is A079282 with 0 prepended. - Michael Somos, Dec 31 2012
a(n) = (-1)^n * Sum_{k=0..n} binomial(k-2,n-k). - Seiichi Manyama, Aug 14 2024
EXAMPLE
1 + x + 3*x^2 + 2*x^3 + 6*x^4 + 2*x^5 + 11*x^6 - x^7 + 21*x^8 - 12*x^9 + 44*x^10 + ...
MATHEMATICA
Table[(-1)^n*Fibonacci[n - 1] + n, {n, 0, 100}] (* Vladimir Joseph Stephan Orlovsky, Jun 28 2011 *)
PROG
(PARI) {a(n) = fibonacci(1-n) + n} /* Michael Somos, Dec 31 2012 */
CROSSREFS
KEYWORD
sign
AUTHOR
N. J. A. Sloane, Nov 17 2002
STATUS
approved