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!)
A140504 a(n) = 2^n + 4. 20

%I #36 Nov 11 2023 19:56:05

%S 5,6,8,12,20,36,68,132,260,516,1028,2052,4100,8196,16388,32772,65540,

%T 131076,262148,524292,1048580,2097156,4194308,8388612,16777220,

%U 33554436,67108868,134217732,268435460,536870916,1073741828

%N a(n) = 2^n + 4.

%H G. C. Greubel, <a href="/A140504/b140504.txt">Table of n, a(n) for n = 0..1000</a>

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

%F G.f.: (5 - 9*x)/((1 - x)*(1 - 2*x)). - _Jaume Oliver Lafont_, Aug 30 2009

%F a(n) = 2*a(n-1) - 4 with a(0) = 5. - _Vincenzo Librandi_, Nov 24 2009

%F From _Reinhard Zumkeller_, Feb 28 2010: (Start)

%F a(n) = A173786(n,2) for n > 1.

%F a(n+2)*A028399(n) = A175164(2*n). (End)

%F From _G. C. Greubel_, Jul 08 2021: (Start)

%F a(n) = m*(2^(n-2) + 1), with m = 4.

%F E.g.f.: exp(2*x) + 4*exp(x). (End)

%t Table[2^n + 4, {n, 0, 30}] (* _Stefan Steinerberger_, Aug 04 2008 *)

%t LinearRecurrence[{3,-2}, {5,6}, 40] (* _Harvey P. Dale_, May 26 2018 *)

%o (Sage) [2^n + 4 for n in range(0,31)] # _Zerinvary Lajos_, May 31 2009

%o (PARI) a(n)=2^n+4 \\ _Charles R Greathouse IV_, Dec 21 2011

%o (Magma) [2^n +4: n in [0..30]]; // _G. C. Greubel_, Jul 08 2021

%Y Cf. A000051 (m=0), A052548 (m=2), this sequence (m=4), A153973 (m=6), A231643 (m=5), A175161 (m=8), A175162 (m=16), A175163 (m=32).

%K nonn,easy

%O 0,1

%A _Paul Curtz_, Jun 30 2008

%E More terms from _Stefan Steinerberger_, Aug 04 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 19:59 EDT 2024. Contains 371963 sequences. (Running on oeis4.)