cp's OEIS Frontend

A135092 Binomial transform of [1, 6, 1, 6, 1, 6, ...].

%I A135092 #28 Nov 03 2018 08:44:17
%S A135092 1,7,14,28,56,112,224,448,896,1792,3584,7168,14336,28672,57344,114688,
%T A135092 229376,458752,917504,1835008,3670016,7340032,14680064,29360128,
%U A135092 58720256,117440512,234881024,469762048,939524096,1879048192,3758096384,7516192768,15032385536
%N A135092 Binomial transform of [1, 6, 1, 6, 1, 6, ...].
%H A135092 Vincenzo Librandi, <a href="/A135092/b135092.txt">Table of n, a(n) for n = 0..3000</a>
%H A135092 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (2).
%F A135092 a(n) = 7*2^(n-1) for n>0, a(0)=1.
%F A135092 a(n) = Sum_{k=0..n} A097805(n,k)*7^k*(-5)^(n-k). - _Philippe Deléham_, Nov 19 2007
%F A135092 G.f.: (1+5*x)/(1-2*x). - _Bruno Berselli_, Sep 20 2011
%F A135092 E.g.f.: (1/2)*(7*exp(2*x) - 5). - _G. C. Greubel_, Sep 22 2016
%F A135092 a(n) = A125176(n+2) for n >= 1. - _Georg Fischer_, Nov 02 2018
%e A135092 a(3) = (1, 3, 3, 1) dot (1, 6, 1, 6) = (1 + 18 + 3 + 6) = 28 = 7*2^2.
%t A135092 Join[{1},NestList[2#&,7,50]] (* _Harvey P. Dale_, Aug 30 2015 *)
%Y A135092 Essentially identical to A005009 and to A125176.
%K A135092 nonn,easy
%O A135092 0,2
%A A135092 _Gary W. Adamson_, Nov 18 2007
%E A135092 Corrected and extended by _Philippe Deléham_ and _N. J. A. Sloane_, Dec 15 2007