|
Search: id:A137284
|
|
|
| A137284 |
|
Consider Sum{ k = 1,2,3,.. } 2^(-nk). Sequence lists the minimal powers nk for which, at any step of addition, the decimal digits of the previous number are unchanged. |
|
+0
2
|
| |
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
Conjecture: a(n+1)=ceil[a(n)*A020862]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 01 2008
|
|
EXAMPLE
|
Start from 0.
0 + 2^(-1)= 0.5
0.5 + 2^(-4)= 0.5625 (first digit "5" is equal to the decimal of prevoius number)
0.5625 + 2^(-14)=0.56256103515625 (first digits "5625" are equal to the decimals of prevoius number)
etc.
|
|
CROSSREFS
|
Adjacent sequences: A137281 A137282 A137283 this_sequence A137285 A137286 A137287
Sequence in context: A104487 A094789 A082574 this_sequence A121095 A000908 A015651
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Mar 14 2008
|
|
|
Search completed in 0.002 seconds
|
