Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060182
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060182 a(0) = 1, a(1) = 5, a(2) = 13; a(n) = 2*a(n-1) + 2, n > 2. +0
1
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; listen)
OFFSET

0,2

COMMENT

Sometimes confused with A002717.

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.

CROSSREFS

Adjacent sequences: A060179 A060180 A060181 this_sequence A060183 A060184 A060185

Sequence in context: A027962 A023537 A023653 this_sequence A133204 A100877 A007521

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 njas at the suggestion of Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Sep 16 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research