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!)
A156203 a(n) = 2*a(n-1) + 3 for n>1, a(1)=14. 1

%I #14 Sep 08 2022 08:45:41

%S 14,31,65,133,269,541,1085,2173,4349,8701,17405,34813,69629,139261,

%T 278525,557053,1114109,2228221,4456445,8912893,17825789,35651581,

%U 71303165,142606333,285212669,570425341,1140850685,2281701373

%N a(n) = 2*a(n-1) + 3 for n>1, a(1)=14.

%H Vincenzo Librandi, <a href="/A156203/b156203.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = 17*2^(n-1)-3.

%F G.f. x*(14-11*x)/((1-x)*(1-2*x)). [_R. J. Mathar_, Feb 09 2009]

%t CoefficientList[Series[(14 - 11 x)/((1-x) (1-2 x)), {x, 0, 40}], x] (* _Vincenzo Librandi_, Apr 08 2013 *)

%o (Magma) [17*2^(n-1)-3: n in [1..30]]; // _Vincenzo Librandi_, Apr 08 2013

%K nonn,easy

%O 1,1

%A _Vincenzo Librandi_, Feb 08 2009

%E Corrected typo in a(11) by _R. J. Mathar_, Feb 09 2009

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 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)