Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A061519
a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 5.
2
1, 6, 11, 66, 1111, 6666, 11111111, 66666666, 1111111111111111, 6666666666666666, 11111111111111111111111111111111, 66666666666666666666666666666666
OFFSET
0,2
COMMENTS
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, Jan 17 2009]
LINKS
FORMULA
a(2n) = 6*[10^{2^(n)} - 1]/9 a(2n+1) = [10^(2^n) - 1]/9
MATHEMATICA
With[{nn=5}, Join[Table[FromDigits[PadRight[{}, 2^n, 1]], {n, 0, nn}], Table[FromDigits[PadRight[{}, 2^n, 6]], {n, 0, nn}]]]//Sort (* Harvey P. Dale, Jan 23 2025 *)
CROSSREFS
Sequence in context: A110445 A305608 A128387 * A193664 A080875 A001543
KEYWORD
base,nonn,changed
AUTHOR
Amarnath Murthy, May 08 2001
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001
STATUS
approved