login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #5 Dec 05 2013 19:54:51

%S 1,6,11,66,1111,6666,11111111,66666666,1111111111111111,

%T 6666666666666666,11111111111111111111111111111111,

%U 66666666666666666666666666666666

%N a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 5.

%C 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.

%C Number of digits of each term is the sequence A016116. [From _Dmitry Kamenetsky_, Jan 17 2009]

%F a(2n) = 6*[10^{2^(n)} - 1]/9 a(2n+1) = [10^(2^n) - 1]/9

%K base,nonn

%O 0,2

%A _Amarnath Murthy_, May 08 2001

%E More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)