|
Search: id:A061519
|
|
|
| A061519 |
|
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 5. |
|
+0
2
|
|
| 1, 6, 11, 66, 1111, 6666, 11111111, 66666666, 1111111111111111, 6666666666666666, 11111111111111111111111111111111, 66666666666666666666666666666666
(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.
Number of digits of each term is the sequence A016116. [From Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), Jan 17 2009]
|
|
FORMULA
|
a(2n) = 6*[10^{2^(n)} - 1]/9 a(2n+1) = [10^(2^n) - 1]/9
|
|
CROSSREFS
|
Sequence in context: A073219 A110445 A128387 this_sequence A080875 A001543 A077705
Adjacent sequences: A061516 A061517 A061518 this_sequence A061520 A061521 A061522
|
|
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
|
