login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
14, 31, 65, 133, 269, 541, 1085, 2173, 4349, 8701, 17405, 34813, 69629, 139261, 278525, 557053, 1114109, 2228221, 4456445, 8912893, 17825789, 35651581, 71303165, 142606333, 285212669, 570425341, 1140850685, 2281701373 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

FORMULA

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

G.f. x*(14-11*x)/((1-x)*(1-2*x)). [R. J. Mathar, Feb 09 2009]

MATHEMATICA

CoefficientList[Series[(14 - 11 x)/((1-x) (1-2 x)), {x, 0, 40}], x] (* Vincenzo Librandi, Apr 08 2013 *)

PROG

(MAGMA) [17*2^(n-1)-3: n in [1..30]]; // Vincenzo Librandi, Apr 08 2013

CROSSREFS

Sequence in context: A015222 A054103 A161454 * A338389 A196135 A276301

Adjacent sequences:  A156200 A156201 A156202 * A156204 A156205 A156206

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Feb 08 2009

EXTENSIONS

Corrected typo in a(11) by R. J. Mathar, Feb 09 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 17:48 EDT 2021. Contains 343742 sequences. (Running on oeis4.)