Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117079
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117079 a(1) = 1; a(n) = 2*a(n-1) + (number of digits in a(n-1)). +0
1
1, 3, 7, 15, 32, 66, 134, 271, 545, 1093, 2190, 4384, 8772, 17548, 35101, 70207, 140419, 280844, 561694, 1123394, 2246795, 4493597, 8987201, 17974409, 35948826, 71897660, 143795328, 287590665, 575181339, 1150362687, 2300725384 (list; graph; listen)
OFFSET

1,2

EXAMPLE

1*2+1=3

3*2+1=7

7*2+1=15

15*2+2=3

etc.

MATHEMATICA

a[1] = 1; a[n_] := a[n] = 2a[n - 1] + Floor[Log[10, a[n - 1]]] + 1 - Robert G. Wilson v (rgwv(at)rgwv.com), Apr 20 2006

CROSSREFS

Sequence in context: A147250 A066175 A132978 this_sequence A026745 A139333 A099444

Adjacent sequences: A117076 A117077 A117078 this_sequence A117080 A117081 A117082

KEYWORD

easy,nonn,base

AUTHOR

Zededarian Zee (Zededarian(AT)Gmail.com), Apr 19 2006

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jonathan Vos Post (jvospost3(AT)gmail.com), Robert G. Wilson v (rgwv(at)rgwv.com) and James Greene (jmg482(AT)psu.edu), Apr 20 2006. Also from Atilla Bora (borabanana(AT)gmail.com), Apr 23 2006

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research