login
a(n) = 101*2^(n-1) - 100.
0

%I #20 Sep 29 2024 21:09:17

%S 1,102,304,708,1516,3132,6364,12828,25756,51612,103324,206748,413596,

%T 827292,1654684,3309468,6619036,13238172,26476444,52952988,105906076,

%U 211812252,423624604,847249308,1694498716

%N a(n) = 101*2^(n-1) - 100.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).

%F a(n) = 2*a(n-1) + 100 = 100*A000225(n-1) + A000079(n-1).

%F Binomial transform of [1, 101, 101, 101,...].

%F a(n) = 3*a(n-1)-2*a(n-2). G.f.: x*(1+99*x)/((1-x)*(1-2*x)). - _Colin Barker_, Aug 12 2012

%e a(4) = 708 = 2*a(3) + 100 = 2*304 + 100.

%e a(4) = 708 = (1, 3, 3, 1) dot (1, 101, 101, 101) = 1 + 303 + 303 + 101.

%p seq(101*2^(n-1)-100,n=1..25); # _Emeric Deutsch_, May 07 2008

%Y Cf. A000079, A000225.

%K nonn,easy

%O 1,2

%A _Gary W. Adamson_, May 03 2008

%E More terms and new name from _Emeric Deutsch_, May 07 2008