OFFSET
0,1
COMMENTS
Inverse binomial transform of A176415.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (-2).
FORMULA
a(n) = A110164(n+2) for n > 0.
a(n) = 3*(-2)^n = 3*A122803(n+1) for n > 0; a(0) = 7.
a(n) = -2*a(n-1) for n > 1; a(0) = 7, a(1) = -6.
a(n) = (-1)^n*A111286(n+2) = (-1)^n*A098011(n+4) = (-1)^n*A091629(n) = (-1)^n*A087009(n+3) = (-1)^n*A082505(n+1) = (-1)^n*A042950(n+1) = (-1)^n*A007283(n) = (-1)^n*A003945(n+1), n>0. - R. J. Mathar, Dec 10 2010
E.g.f.: 4 + 3*exp(-2*x). - Alejandro J. Becerra Jr., Feb 15 2021
MATHEMATICA
Join[{7}, NestList[-2#&, -6, 40]] (* Harvey P. Dale, Jun 20 2020 *)
PROG
(PARI) {for(n=0, 29, print1(polcoeff((7+8*x)/(1+2*x)+x*O(x^n), n), ", "))}
(PARI) A176414(n)=3*(-2)^n+!n*4 \\ M. F. Hasler, Apr 19 2015
CROSSREFS
KEYWORD
sign,easy
AUTHOR
Klaus Brockhaus, Apr 17 2010
EXTENSIONS
Edited by M. F. Hasler, Apr 19 2015
STATUS
approved