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!)
A061522 a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 7. 18

%I #9 Jun 05 2023 14:03:26

%S 0,7,14,811,1588,8121515,1589812812,812151615891589,

%T 158981281381215168121516,812151615891581015898128131589812813,

%U 15898128138121516812158781215161589158108121516158915810

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

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

%H Indranil Ghosh, <a href="/A061522/b061522.txt">Table of n, a(n) for n = 0..16</a>

%e In the sequence 1588 follows 811 because 8+7 = 15 and 1+7 = 8. - _Indranil Ghosh_, Feb 09 2017

%t NestList[FromDigits[Flatten[IntegerDigits/@(IntegerDigits[#]+7)]]&,0,10] (* _Harvey P. Dale_, Jun 05 2023 *)

%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:50 EDT 2024. Contains 371792 sequences. (Running on oeis4.)