The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061519 a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 5. 1
 1, 6, 11, 66, 1111, 6666, 11111111, 66666666, 1111111111111111, 6666666666666666, 11111111111111111111111111111111, 66666666666666666666666666666666 (list; graph; refs; listen; history; text; internal format)
 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 CROSSREFS Sequence in context: A110445 A305608 A128387 * A193664 A080875 A001543 Adjacent sequences:  A061516 A061517 A061518 * A061520 A061521 A061522 KEYWORD base,nonn AUTHOR Amarnath Murthy, May 08 2001 EXTENSIONS More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 06:59 EDT 2021. Contains 343125 sequences. (Running on oeis4.)