login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133140 a(0) = 2, a(n) = 2^n + 2 for n>=1. 3

%I #18 Jul 03 2023 08:52:18

%S 2,4,6,10,18,34,66,130,258,514,1026,2050,4098,8194,16386,32770,65538,

%T 131074,262146,524290,1048578,2097154,4194306,8388610,16777218,

%U 33554434,67108866,134217730,268435458,536870914,1073741826,2147483650,4294967298

%N a(0) = 2, a(n) = 2^n + 2 for n>=1.

%C Sum of the coefficients of the polynomial Q(n,x)=(1+x)[(1+x)^(n-1)+x^(n-1)], Q(0,x)=2.

%C Also row sums of A133138. - _R. J. Mathar_, Jun 12 2008

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

%F a(n)=2*A094373(n). a(n)=A052548(n), n>0. - _R. J. Mathar_, Jun 12 2008

%t Table[If[n < 2, 2, 1] + Total[Table[Coefficient[Expand[(1 + x) ((1 + x)^(n - 1) + x^(n - 1))], x^m], {m, 1, n}]], {n, 0, 22}] (* _Mats Granvik_, May 19 2012 *)

%t Join[{2},2^Range[40]+2] (* _Harvey P. Dale_, Aug 16 2014 *)

%K nonn,easy

%O 0,1

%A _Paul Curtz_, Sep 21 2007

%E Edited by _R. J. Mathar_, Jun 12 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)