This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A176414 #21 Feb 16 2021 02:07:01
%S A176414 7,-6,12,-24,48,-96,192,-384,768,-1536,3072,-6144,12288,-24576,49152,
%T A176414 -98304,196608,-393216,786432,-1572864,3145728,-6291456,12582912,
%U A176414 -25165824,50331648,-100663296,201326592,-402653184,805306368
%N A176414 Expansion of (7+8*x)/(1+2*x).
%C A176414 Inverse binomial transform of A176415.
%H A176414 Vincenzo Librandi, <a href="/A176414/b176414.txt">Table of n, a(n) for n = 0..1000</a>
%H A176414 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (-2).
%F A176414 a(n) = A110164(n+2) for n > 0.
%F A176414 a(n) = 3*(-2)^n = 3*A122803(n+1) for n > 0; a(0) = 7.
%F A176414 a(n) = -2*a(n-1) for n > 1; a(0) = 7, a(1) = -6.
%F A176414 a(n) = (-1)^n*A132477(n) = (-1)^n*A122391(n+3), n>1.
%F A176414 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
%F A176414 E.g.f.: 4 + 3*exp(-2*x). - _Alejandro J. Becerra Jr._, Feb 15 2021
%t A176414 Join[{7},NestList[-2#&,-6,40]] (* _Harvey P. Dale_, Jun 20 2020 *)
%o A176414 (PARI) {for(n=0, 29, print1(polcoeff((7+8*x)/(1+2*x)+x*O(x^n), n), ", "))}
%o A176414 (PARI) A176414(n)=3*(-2)^n+!n*4 \\ _M. F. Hasler_, Apr 19 2015
%Y A176414 Cf. A176415, A110164 (essentially the same), A122803.
%K A176414 sign,easy
%O A176414 0,1
%A A176414 _Klaus Brockhaus_, Apr 17 2010
%E A176414 Edited by _M. F. Hasler_, Apr 19 2015