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!)
A198274 a(n) = 13*2^n-1. 6
12, 25, 51, 103, 207, 415, 831, 1663, 3327, 6655, 13311, 26623, 53247, 106495, 212991, 425983, 851967, 1703935, 3407871, 6815743, 13631487, 27262975, 54525951, 109051903, 218103807, 436207615, 872415231, 1744830463, 3489660927, 6979321855, 13958643711 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

a(n) + a(n-1)^2 = (a(n-1)+1)^2. - Vincenzo Librandi, Mar 24 2013

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (3,-2).

FORMULA

a(n+1) = 2*a(n) + 1.

G.f.: ( 12-11*x ) / ( (2*x-1)*(x-1) ). - R. J. Mathar, Oct 25 2011

EXAMPLE

a(2) = 13*2^2-1 = 51.

MATHEMATICA

Table[13 2^n - 1, {n, 0, 30}] (* Vincenzo Librandi, Mar 24 2013 *)

LinearRecurrence[{3, -2}, {12, 25}, 40] (* Harvey P. Dale, Feb 06 2019 *)

PROG

(BASIC) for j = 0 to 30 : print str$((13*2^j)-1)+", "; : next j

(MAGMA) [13*2^n-1: n in [0..30]]; // Vincenzo Librandi, Oct 28 2011

(PARI) a(n) = 13*2^n-1; \\ Michel Marcus, Jan 17 2016

CROSSREFS

Cf. A005029, A086224.

Sequence in context: A164577 A195143 A280321 * A229447 A175523 A280391

Adjacent sequences:  A198271 A198272 A198273 * A198275 A198276 A198277

KEYWORD

nonn,easy

AUTHOR

Jeremy Gardiner, Oct 23 2011

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 August 5 15:15 EDT 2021. Contains 346472 sequences. (Running on oeis4.)