|
Search: id:A061518
|
|
|
| A061518 |
|
a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 5. |
|
+0
1
|
|
| 0, 5, 10, 61, 116, 6611, 111166, 66661111, 111111116666, 6666666611111111, 111111111111111166666666, 66666666666666661111111111111111, 111111111111111111111111111111116666666666666666
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
In A061511-A061522, A061746-A061750 when the incremented digit exceeds 9 it is written as a 2-digit string. So 9+1 becomes the 2-digit string 10, etc.
|
|
FORMULA
|
a(2n+4) = {10^(2^n)}*6*[10^{2^(n)} - 1]/9 + [10^(2^n) -1]/9 a(2n+3) = {10^(2^(n-1))}*[10^(2^n) - 1]/9 + 6*[10^(2^(n-1)) - 1]/9
|
|
CROSSREFS
|
Sequence in context: A081076 A005438 A072309 this_sequence A062162 A062848 A054884
Adjacent sequences: A061515 A061516 A061517 this_sequence A061519 A061520 A061521
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 08 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001
|
|
|
Search completed in 0.002 seconds
|
