login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060182 a(0) = 1, a(1) = 5, a(2) = 13; a(n) = 2*a(n-1) + 2, n > 2. 2
1, 5, 13, 28, 58, 118, 238, 478, 958, 1918, 3838, 7678, 15358, 30718, 61438, 122878, 245758, 491518, 983038, 1966078, 3932158, 7864318, 15728638, 31457278, 62914558, 125829118, 251658238, 503316478, 1006632958, 2013265918 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Sometimes confused with A002717.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,200

FORMULA

a_n = 3((a_n-1)-(a_n-2)+(a_n-3)-...((-1)^(n+1))a_0)+1; a_n = (2^(n-3))a_3 + (2^(n-2))-2 for n > 3.

G.f.: -(1+x)*(x^2-x-1)/((-1+x)*(-1+2*x)). a(n)=15*2^(n-2)-2, n>1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 15 2009]

PROG

(PARI) { a=-1; for (n=0, 200, a=2*a + 2; if (n<3, a++); write("b060182.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 02 2009]

CROSSREFS

Sequence in context: A027962 A023537 A023653 * A147066 A189485 A178854

Adjacent sequences:  A060179 A060180 A060181 * A060183 A060184 A060185

KEYWORD

nonn,easy

AUTHOR

Brian Wallace (wallacebrianedward(AT)yahoo.co.uk), Mar 19 2001

EXTENSIONS

Simpler formula and more terms from Larry Reeves (larryr(AT)acm.org), Mar 30 2001

Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion of Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Sep 16 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 15:39 EST 2012. Contains 205635 sequences.